DocumentCode
3298640
Title
Solving MEC model of haplotype reconstruction using information fusion, single greedy and parallel clustering approaches
Author
Asgarian, E. ; Moeinzadeh, M.-H. ; Sharifian-R, S. ; Najafi, A. ; Ramezani, A. ; Habibi, J. ; Mohammadzadeh, J.
Author_Institution
Sharif Univ. of Technol., Tehran
fYear
2008
fDate
March 31 2008-April 4 2008
Firstpage
15
Lastpage
19
Abstract
Haplotype information has become increasingly important in analyzing fine-scale molecular genetics data, Due to the mutated form in human genome; SNPs (Single Nucleotide Polymorphism) are responsible for some genetic diseases. As a consequence, obtaining all SNPs from human populations is one of the primary goals of studies in human genomics. In this paper, a data fusion method based on multiple parallel classifiers for reconstruction of haplotypes from a given sample Single Nucleotide Polymorphism (SNP) is proposed. First, we design a single greedy algorithm for solving haplotype reconstructions. [2] is used as an efficient approach to be combined with first classification method. The methods and information fusion approach are aimed specifically for increasing reconstruction rate of the problem in Minimum Error Correction Model (MEC) which is one of haplotyping problem models belonging to NP-hard class. Designing a parallel classifier, which helps us cover the single classifier´s weaknesses, was the focus of our research.
Keywords
biology computing; error correction; genetics; greedy algorithms; sensor fusion; fine-scale molecular genetics data; haplotype reconstruction; information fusion; minimum error correction model; parallel clustering; single greedy algorithm; single nucleotide polymorphism; Algorithm design and analysis; Bioinformatics; DNA; Diseases; Error correction; Genetic engineering; Genomics; Greedy algorithms; Humans; Sequences;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Systems and Applications, 2008. AICCSA 2008. IEEE/ACS International Conference on
Conference_Location
Doha
Print_ISBN
978-1-4244-1967-8
Electronic_ISBN
978-1-4244-1968-5
Type
conf
DOI
10.1109/AICCSA.2008.4493511
Filename
4493511
Link To Document