Haplotyping populations by pure parsimony: Complexity of exact and approximation algorithms

INFORMS Journal on Computing

Volumn 16, Issue 4, 2004, Pages 348-359

  Lancia, Giuseppe ^a   Pinotti, Maria Cristina ^b   Rizzi, Romeo ^c  

^a UNIVERSITY OF UDINE   (Italy)

^b UNIVERSITY OF PERUGIA   (Italy)

^c UNIVERSITY OF TRENTO   (Italy)

Author keywords

Compact integer program; Deterministic rounding; Node cover; Pure parsimony haplotyping; SNPs

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GENES; INTEGER PROGRAMMING; LINEAR PROGRAMMING; POLYNOMIALS;

COMPACT INTEGER PROGRAM; DETERMINISTIC ROUNDING; NODE COVER; PURE PARSIMONY HAPLOTYPING; SNP;

PROBLEM SOLVING;

EID: 10044241629     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1040.0085     Document Type: Article

References (23)

1. Alimonti, P., V. Kann. 2000. Hardness of approximating problems on cubic graphs. Theroet. Comput. Sci. 237 123-134.
2. Ausiello, G., P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi. 1999. Complexity and Approximation. Combinatorial Optimization Problems and Their Approximability Properties. Springer, Berlin, Germany.
3. Bafna, V., D. Gusfield, G. Lancia, S. Yooseph. 2003. Haplotyping as perfect phylogeny: A direct approach. J. Comput. Biol. 10 323-340.
4. Bar-Yehuda, R., S. Even. 1985. A local-ratio theorem for approximating the weighted vertex cover problem. Ann. Discrete Math. 25 27-46.
5. Berman, P., M. Karpinski. 1998. On some tighter inapproximability results. Technical report ECCC No. 29, Department of Computer Science, University of Trier, Trier, Germany.
6. Chakravarti, A. 1998. It's raining SNP, hallelujah? Nature Genetics 19 216-217.
7. Chen, J., I. A. Kanj, W. Jia. 2001. Vertex cover: Further observations and further improvements. J. Algorithms 41 280-301.
8. Clark, A. 1990. Inference of haplotypes from PCR-amplified samples of diploid populations. Molecular Biol. Evolution 7 111-122.
9. Eskin, E., E. Halperin, R. Karp. 2003. Efficient reconstruction of haplotype structure via perfect phylogeny. J. Bioinformatics Comput. Biol. 1 1-20.
10. Gusfield, D. 2000. A practical algorithm for optimal inference of haplotypes from diploid populations. Annual Internat. Conf. Intelligent Systems Molecular Biol. AAAI Press, Menlo Park, CA, 183-189.
11. Gusfield, D. 2001. Inference of haplotypes from samples of diploid populations: Complexity and algorithms. J. Comput. Biol. 8 305-324.
12. Gusfield, D. 2003. Haplotype inference by pure parsimony. Annual Sympos. Combin. Pattern Matching. Springer Lecture Notes in Computer Science, No. 2676. Springer-Verlag, Berlin, Germany, 144-155.
13. Helmuth, L. 2001. Genome research: Map of the human genome 3.0. Science 293 583-585.
14. Hubbel, E. 2002. Personal communication.
15. International Human Genome Sequencing Consortium. 2001. Initial sequencing and analysis of the human genome. Nature 409 860-921.
16. Lancia, G., V. Bafna, S. Istrail, R. Lippert, R. Schwartz. 2001. SNPs problems, complexity and algorithms. Annual Eur. Sympos. Algorithms. Springer Lecture Notes in Computer Science, No. 2161. Springer-Verlag, Berlin, Germany, 182-193.
17. Li, L., J. H. Kim, M. Waterman. 2003. Haplotype reconstruction from SNP alignment. ACM Annual Internat. Conf. Comput. Molecular Biol. ACM Press, New York, 207-216.
18. Lippert, R., R. Schwartz, G. Lancia, S. Istrail. 2002. Algorithmic strategies for the SNPs haplotype assembly problem. Briefings Bioinformatics 3 23-31.
19. Marshall, E. 1999. Drug firms to create public database of genetic mutations. Sci. Magazine 284 406-407.
20. Nemhauser, G. L., L. E. Trotter. 1975. Vertex packings: Structural properties and algorithms. Math. Programming 8 232-248.
21. Papadimitriou, C. H., M. Yannakakis. 1991. Optimization, approximation, and complexity classes. J. Comput. System Sci. 43 425-440.
22. Rizzi, R., V. Bafna, S. Istrail, G. Lancia. 2002. Practical algorithms and fixed-parameter tractability for the single individual SNP haplotyping problem. Annual Workshop on Algorithms in Bioinformatics. Springer Lecture Notes in Computer Science, No. 2452. Springer-Verlag, Berlin, Germany, 29-43.
23. Venter, J. C., et al. 2001. The sequence of the human genome. Science 291 1304-1351.