A practical exact algorithm for the individual haplotyping problem MEC/GI

Algorithmica (New York)

Volumn 56, Issue 3, 2010, Pages 283-296

  Wang, Jianxin ^a   Xie, Minzhu ^a,b   Chen, Jianer ^a,c  

^a CENTRAL SOUTH UNIVERSITY   (China)

^b HUNAN NORMAL UNIVERSITY   (China)

^c TEXAS A AND M UNIVERSITY   (United States)

Author keywords

Genotype; Haplotype; NP hardness; Parameterized algorithm; SNP (single nucleotide polymorphism)

Indexed keywords

BIOLOGICAL APPLICATIONS; COMPLEX DISEASE; COMPUTATIONAL MODEL; COMPUTATIONAL TECHNIQUE; DNA FRAGMENT; DYNAMIC PROGRAMMING ALGORITHM; EXACT ALGORITHMS; HAPLOTYPES; HAPLOTYPING; HIGH-THROUGHPUT; MINIMUM ERROR CORRECTION; MOLECULAR-BIOLOGICAL TECHNIQUES; NP-HARD; NP-HARDNESS; NUCLEOTIDE BASIS; PARAMETERIZED ALGORITHM; RUNNING TIME; SINGLE NUCLEOTIDE POLYMORPHISMS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DNA; ERROR CORRECTION; GENES; GENETIC PROGRAMMING; HARDNESS; NUCLEOTIDES; POLYMORPHISM;

COMPUTATIONAL EFFICIENCY;

EID: 74849121788     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-009-9288-1     Document Type: Conference Paper

References (20)

1. D.G. Wang J.B. Fan C.J. Siao, et al. 1998 Large-scale identification, mapping, and genotyping of single-nucleotide polymorphisms in the human genome Science 280 5366 1077 1082 10.1126/science.280.5366.1077 (Pubitemid 28234949)
2. J.C. Stephens J.A. Schneider D.A. Tanguay, et al. 2001 Haplotype variation and linkage disequilibrium in 313 human genes Science 293 5529 489 493 10.1126/science.1059431 (Pubitemid 32679076)
3. X.S. Zhang R.S. Wang L.Y. Wu L. Chen 2006 Models and algorithms for haplotyping problem Curr. Bioinform. 1 1 105 114 10.2174/157489306775330570
4. Lancia, G., Bafna, V., Istrail, S., Lippert, R., Schwartz, R.: SNPs problems, complexity and algorithms. In: Meyer, F. (ed.) Proc. Ann. European Symp. on Algorithms (ESA). Lecture Notes in Computer Science, vol. 2191, pp. 182-193. Springer, Berlin (2001)
5. Gusfield, D.: An overview of combinatorial methods for haplotype inference. In: Istrail, S., Waterman, M.S., Clark, A.G. (eds.) The 1st RECOMB Satellite Workshop on Computational Methods for SNPs and Haplotype Inference. Lecture Notes in Computer Science, vol. 2983, pp. 9-25. Springer, Berlin (2004)
6. M. Xie J. Chen J. Wang 2007 Research on parameterized algorithms of the individual haplotyping problem J. Bioinform. Comput. Biol. 5 3 795 816 10.1142/S0219720007002710 2338373 (Pubitemid 47261127)
7. M. Xie J. Wang 2008 An improved (and practical) parameterized algorithm for the individual haplotyping problem MFR with mate-pairs Algorithmica 52 2 250 266 1173.68834 10.1007/s00453-007-9150-2 2434967
8. R. Lippert R. Schwartz G. Lancia S. Istrail 2002 Algorithmic strategies for the single nucleotide polymorphism haplotype assembly problem Brief. Bioinform. 3 1 1 9 10.1093/bib/3.1.23
9. R.S. Wang L.Y. Wu Z.P. Li X.S. Zhang 2005 Haplotype reconstruction from SNP fragments by minimum error correction Bioinformatics 21 10 2456 2462 10.1093/bioinformatics/bti352 (Pubitemid 40731602)
10. X. Zhang R. Wang L. Wu W. Zhang 2006 Minimum conflict individual haplotyping from SNP fragments and related genotype Evol. Bioinform. 2 271 280
11. Downey, R., Fellows, M.: Parameterized Complexity. Springer, Berlin (1999)
12. J. Chen 2005 Parameterized computation and complexity: a new approach dealing with NP-hardness J. Comput. Sci. Technol. 20 1 18 37 10.1007/s11390-005-0003-7
13. The International SNP Map Working Group 2001 A map of human genome sequence variation containing 1.42 million single nucleotide polymorphisms Nature 409 6822 928 933 10.1038/35057149 (Pubitemid 32165347)
14. F. Sanger S. Nicklen A.R. Coulson 1977 DNA sequencing with chain-terminating inhibitors Proc. Natl. Acad. Sci. 74 12 5463 5467 10.1073/pnas.74.12.5463
15. S.B. Gabriel S.F. Schaffner H. Nguyen, et al. 2002 The structure of haplotype blocks in the human genome Science 296 5576 2225 2229 10.1126/science.1069424 (Pubitemid 34680308)
16. D.A. Hinds L.L. Stuve G.B. Nilsen, et al. 2005 Whole-genome patterns of common DNA variation in three human populations Science 307 5712 1072 1079 10.1126/science.1105436 (Pubitemid 40262106)
17. The International HapMap Consortium 2005 A haplotype map of the human genome Nature 437 7063 1299 1320 10.1038/nature04226 (Pubitemid 41568671)
18. Hüffner, F.: Algorithm engineering for optimal graph bipartization. In: Nikoletseas, S.E. (ed.) Proc. WEA. Lecture Notes in Computer Science, vol. 3503, pp. 240-252. Springer, Berlin (2005)
19. Panconesi, A., Sozio, M.: Fast hare: a fast heuristic for single individual SNP haplotype reconstruction. In: Jonassen, I., Kim, J. (eds.) Proc. WABI. Lecture Notes in Computer Science, vol. 3240, pp. 266-277. Springer, Berlin (2004)
20. Myers, G.: A dataset generator for whole genome shotgun sequencing. In: Lengauer, T., Schneider, R., Bork, P., (eds.) Proc. ISMB, pp. 202-210. AAAI Press, Menlo Park (1999)