{"id":{"repo_id":"cent-lancashire","oai_identifier":"oai:clok.uclan.ac.uk:20368"},"canonical_url":"https://search.dev.ndltd.org/etd/cent-lancashire/oai:clok.uclan.ac.uk:20368","repository":{"repo_id":"cent-lancashire","name":"University of Central Lancashire","base_url":"https://clok.uclan.ac.uk/cgi/oai2"},"display":{"title":"Comparative analysis of algorithms for identifying copy number variation in array CGH data","abstract":"The aim of the study is comparative analysis of algorithms for identifying copy number variation in array CGH data. Circular Binary segmentation (CBS), CGH segmentation, Price —Smith—Waterman algorithm (the three algorithms are a part of ADaCGH tool) and Cluster Along Chromosome (CLAC) which is not publicly available were studied and used for the analysis of array CGH data. Simulated data set was generated by adding signals of various intensities such as I unit, 11 units and III units representing gains in the copy number (Copy Number Variation, CNV) at random positions corresponding to real probes covering human genome and by adding white Gaussian noise. The white Gaussian noise was generated with the help of program provided by Dr. Nadia Chuzhanova. Two studies of simulated data are carried out in this project (1) The aim of the first study was to investigate the minimum width of CNV (in probes / BAC clones) that can be detected by the all the algorithms for signal intensity of I, II and III units. (2) The aim of the second study was to detect the minimum gap (in probes/BAC clones) between two CNVs of width 2-12 probes /BAC clones by each algorithm for a signal intensity of I, II and 111 units. The results of the study showed that CGH segmentation and CBS can detect a CNV of minimum width 2 BAC clones/probes in simulated data set. However Price-Smith-Waterman algorithm failed to detect any generated CNV. Studies showed that the CNV detection by both algorithms is influenced by noise as well as the width of CNV and the intensity of CNV. The studies also showed that though CBS was able to detect most of the generated CNVs it is more efficient for detection of CNV having higher width. CGH segmentation was more efficient in detection of CNVs that have lower width. Thus CBS and CGH segmentation efficiently can be used for the analysis of array CGH data. The real data set was obtained from 24 malignant peripheral nerve sheath tumour samples and 3 neurofibromas samples (from 27 patients). This data was then analysed with the help of CBS and CGH segmentation on the basis of the results obtained from simulated data set. In general, the ADaCGH is a very good tool for the analysis of array CGH data.","abstract_html":"The aim of the study is comparative analysis of algorithms for identifying copy number variation in array CGH data. Circular Binary segmentation (CBS), CGH segmentation, Price —Smith—Waterman algorithm (the three algorithms are a part of ADaCGH tool) and Cluster Along Chromosome (CLAC) which is not publicly available were studied and used for the analysis of array CGH data. Simulated data set was generated by adding signals of various intensities such as I unit, 11 units and III units representing gains in the copy number (Copy Number Variation, CNV) at random positions corresponding to real probes covering human genome and by adding white Gaussian noise. The white Gaussian noise was generated with the help of program provided by Dr. Nadia Chuzhanova. Two studies of simulated data are carried out in this project (1) The aim of the first study was to investigate the minimum width of CNV (in probes / BAC clones) that can be detected by the all the algorithms for signal intensity of I, II and III units. (2) The aim of the second study was to detect the minimum gap (in probes/BAC clones) between two CNVs of width 2-12 probes /BAC clones by each algorithm for a signal intensity of I, II and 111 units. The results of the study showed that CGH segmentation and CBS can detect a CNV of minimum width 2 BAC clones/probes in simulated data set. However Price-Smith-Waterman algorithm failed to detect any generated CNV. Studies showed that the CNV detection by both algorithms is influenced by noise as well as the width of CNV and the intensity of CNV. The studies also showed that though CBS was able to detect most of the generated CNVs it is more efficient for detection of CNV having higher width. CGH segmentation was more efficient in detection of CNVs that have lower width. Thus CBS and CGH segmentation efficiently can be used for the analysis of array CGH data. The real data set was obtained from 24 malignant peripheral nerve sheath tumour samples and 3 neurofibromas samples (from 27 patients). This data was then analysed with the help of CBS and CGH segmentation on the basis of the results obtained from simulated data set. In general, the ADaCGH is a very good tool for the analysis of array CGH data.","abstract_has_math":false,"creators":["Kamat, Mihir Anant"],"institution":"University of Central Lancashire","degree_name":"ma","degree_level":"masters","degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2009,"date_issued":"2009-09","date_published":"2009-09","updated_at":"2026-07-24T01:36:13Z","subjects":["F990 - Physical sciences not elsewhere classified"],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":null,"outbound_label":null,"outbound_source":null},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Kamat, Mihir Anant"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2009-09-01"]},{"key":"dc:date.issued","label":"Date","values":["2009-09"]},{"key":"dc:publisher.department","label":"Dc Publisher Department","values":["Computing, Engineering and Physical Sciences"]},{"key":"dc:publisher.institution","label":"Dc Publisher Institution","values":["University of Central Lancashire"]},{"key":"dc:relation.isreferencedby","label":"Dc Relation Isreferencedby","values":["https://knowledge.lancashire.ac.uk/id/eprint/20368/"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.qualificationlevel","label":"Dc Type Qualificationlevel","values":["masters"]},{"key":"dc:type.qualificationname","label":"Dc Type Qualificationname","values":["ma"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["F990 - Physical sciences not elsewhere classified"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://knowledge.lancashire.ac.uk/id/eprint/20368/1/20368%20Mihir%20Anant%20Kamat%20Sep09%20comparative%20analysis%20of%20algorithms%20for%20identifying%20copy%20number%20varation%20in%20array%20cgh%20data.%20Masters%20degree%20%20unpublished%20Sep09.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["The aim of the study is comparative analysis of algorithms for identifying copy number variation in array CGH data. Circular Binary segmentation (CBS), CGH segmentation, Price —Smith—Waterman algorithm (the three algorithms are a part of ADaCGH tool) and Cluster Along Chromosome (CLAC) which is not publicly available were studied and used for the analysis of array CGH data. Simulated data set was generated by adding signals of various intensities such as I unit, 11 units and III units representing gains in the copy number (Copy Number Variation, CNV) at random positions corresponding to real probes covering human genome and by adding white Gaussian noise. The white Gaussian noise was generated with the help of program provided by Dr. Nadia Chuzhanova. Two studies of simulated data are carried out in this project (1) The aim of the first study was to investigate the minimum width of CNV (in probes / BAC clones) that can be detected by the all the algorithms for signal intensity of I, II and III units. (2) The aim of the second study was to detect the minimum gap (in probes/BAC clones) between two CNVs of width 2-12 probes /BAC clones by each algorithm for a signal intensity of I, II and 111 units. The results of the study showed that CGH segmentation and CBS can detect a CNV of minimum width 2 BAC clones/probes in simulated data set. However Price-Smith-Waterman algorithm failed to detect any generated CNV. Studies showed that the CNV detection by both algorithms is influenced by noise as well as the width of CNV and the intensity of CNV. The studies also showed that though CBS was able to detect most of the generated CNVs it is more efficient for detection of CNV having higher width. CGH segmentation was more efficient in detection of CNVs that have lower width. Thus CBS and CGH segmentation efficiently can be used for the analysis of array CGH data. The real data set was obtained from 24 malignant peripheral nerve sheath tumour samples and 3 neurofibromas samples (from 27 patients). This data was then analysed with the help of CBS and CGH segmentation on the basis of the results obtained from simulated data set. In general, the ADaCGH is a very good tool for the analysis of array CGH data."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Comparative analysis of algorithms for identifying copy number variation in array CGH data"]}]}],"canonical_facts":{"dc:creator":["Kamat, Mihir Anant"],"dc:date":["2009-09-01"],"dc:date.issued":["2009-09"],"dc:description.abstract":["The aim of the study is comparative analysis of algorithms for identifying copy number variation in array CGH data. Circular Binary segmentation (CBS), CGH segmentation, Price —Smith—Waterman algorithm (the three algorithms are a part of ADaCGH tool) and Cluster Along Chromosome (CLAC) which is not publicly available were studied and used for the analysis of array CGH data. Simulated data set was generated by adding signals of various intensities such as I unit, 11 units and III units representing gains in the copy number (Copy Number Variation, CNV) at random positions corresponding to real probes covering human genome and by adding white Gaussian noise. The white Gaussian noise was generated with the help of program provided by Dr. Nadia Chuzhanova. Two studies of simulated data are carried out in this project (1) The aim of the first study was to investigate the minimum width of CNV (in probes / BAC clones) that can be detected by the all the algorithms for signal intensity of I, II and III units. (2) The aim of the second study was to detect the minimum gap (in probes/BAC clones) between two CNVs of width 2-12 probes /BAC clones by each algorithm for a signal intensity of I, II and 111 units. The results of the study showed that CGH segmentation and CBS can detect a CNV of minimum width 2 BAC clones/probes in simulated data set. However Price-Smith-Waterman algorithm failed to detect any generated CNV. Studies showed that the CNV detection by both algorithms is influenced by noise as well as the width of CNV and the intensity of CNV. The studies also showed that though CBS was able to detect most of the generated CNVs it is more efficient for detection of CNV having higher width. CGH segmentation was more efficient in detection of CNVs that have lower width. Thus CBS and CGH segmentation efficiently can be used for the analysis of array CGH data. The real data set was obtained from 24 malignant peripheral nerve sheath tumour samples and 3 neurofibromas samples (from 27 patients). This data was then analysed with the help of CBS and CGH segmentation on the basis of the results obtained from simulated data set. In general, the ADaCGH is a very good tool for the analysis of array CGH data."],"dc:format":["application/pdf"],"dc:identifier.uri":["https://knowledge.lancashire.ac.uk/id/eprint/20368/1/20368%20Mihir%20Anant%20Kamat%20Sep09%20comparative%20analysis%20of%20algorithms%20for%20identifying%20copy%20number%20varation%20in%20array%20cgh%20data.%20Masters%20degree%20%20unpublished%20Sep09.pdf"],"dc:language":["en"],"dc:publisher.department":["Computing, Engineering and Physical Sciences"],"dc:publisher.institution":["University of Central Lancashire"],"dc:relation.isreferencedby":["https://knowledge.lancashire.ac.uk/id/eprint/20368/"],"dc:subject":["F990 - Physical sciences not elsewhere classified"],"dc:title":["Comparative analysis of algorithms for identifying copy number variation in array CGH data"],"dc:type":["Thesis"],"dc:type.qualificationlevel":["masters"],"dc:type.qualificationname":["ma"]},"updated_at":"2026-07-24T01:36:13Z"}