A practical exact algorithm for the individual haplotyping problem MEC

BioMedical Engineering and Informatics: New Development and the Future - Proceedings of the 1st International Conference on BioMedical Engineering and Informatics, BMEI 2008

Volumn 1, Issue , 2008, Pages 72-76

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

^a CENTRAL SOUTH UNIVERSITY   (China)

^b HUNAN NORMAL UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

BIOPHYSICS; BOOLEAN FUNCTIONS; DNA; DNA SEQUENCES; GENES; NUCLEAR PROPULSION; NUCLEIC ACIDS; ORGANIC ACIDS;

HAPLOTYPING; INFORMATICS;

PROBLEM SOLVING;

EID: 51549107109     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/BMEI.2008.122     Document Type: Conference Paper

References (17)

1. P. Bonizzoni, G. D. Vedova, R. Dondi, and J. Li. The haplotyping problem: an overview of computational models and solutions. J. Comp. Sci. Technol., 18(6):675-688, 2003.
2. S. B. Gabriel, S. R Schaffner, H. Nguyen, et al. The structure of haplotype blocks in the human genome. Science, 296(5576):2225-2229, 2002.
3. I. C. Gray, D. A. Campbell, and N. K. Spurr. Single nucleotide polymorphisms as tools in human genetics. Human Molecular Genetics, 9(16):2403-2408, 2000.
4. H. J. Greenberg, W. E. Hart, and G. Lancia. Opportunities for combinatorial optimization in computational biology. INFORMS J. Comput., 16(3):211-231, 2004.
5. D. A. Hinds, L. L. Stuve, G. B. Nilsen, et al. Whole-genome patterns of common dna variation in three human populations. Science, 307(5712):1072-1079, 2005.
6. A. L. Holden. The snp consortium: summary of a private consortium effort to develop an applied map of the human genome. BioTechniques, 32(Suppl):22-24, 26, 2002.
7. R Hüffner. Algorithm engineering for optimal graph bipartization. In S. E. Nikoletseas, editor, Proc. WEA, volume 3503 of LNCS, pages 240-252, Berlin, 2005. Springer.
8. D. H. Huson, A. L. Halpern, Z. Lai, et al. Comparing assemblies using fragments and mate-pairs. In O. Gascuel and B. M. E. Moret, editors, Proc. WABI, volume 2149 of LNCS, pages 294-306, Berlin, August 2001. Springer.
9. G. Lancia, V. Bafna, S. Istrail, R. Lippert, and R. Schwartz. Snps problems, complexity and algorithms. In F. M. auf der Heide, editor, Proc. ESA, volume 2161 of LNCS, pages 182-193, Berlin, August 2001. Springer.
10. S. Levy, G. Sutton, P. C. Ng, et al. The diploid genome sequence of an individual human. PLoS Biology, 5(10):e254-e254, October 2007.
11. R. Lippert, R. Schwartz, G. Lancia, and S. Istrail. Algorithmic strategies for the single nucleotide polymorphism haplotype assembly problem. Brief. Bioinform, 3(1):1-9, 2002.
12. G. Myers. A dataset generator for whole genome shotgun sequencing. In T. Lengauer, R. Schneider, P. Bork, et al., editors, Proc. ISMB, pages 202-210, California, 1999. AAAI Press.
13. A. Panconesi and M. Sozio. Fast hare: a fast heuristic for single individual snp haplotype reconstruction. In I. Jonassen and J. Kim, editors, Proc. WABI, volume 3240 of LNCS, pages 266-277, Berlin, 2004. Springer.
14. F. Sanger, S. Nicklen, and A. R. Coulson. Dna sequencing with chain-terminating inhibitors. PNAS, 74(12):5463-5467, 1977.
15. The International SNP Map Working Group. A map of human genome sequence variation containing 1.42 million single nucleotide polymorphisms. Nature, 409(6822):928-933, 2001.
16. R. S. Wang, L. Y. Wu, Z. P. Li, and X. S. Zhang. Haplotype reconstruction from snp fragments by minimum error correction. Bioinformatics, 21(10):2456-2462, 2005.
17. S. Wernicke. On the algorithmic tractability of single nucleotide polymorphism (SNP) analysis and related problems. Ph. d. thesis, Univ. Tübingen, 2003.