The phasing of heterozygous traits: Algorithms and complexity

Computers and Mathematics with Applications

Volumn 55, Issue 5, 2008, Pages 960-969

  Lancia, Giuseppe ^a  

^a UNIVERSITY OF UDINE   (Italy)

Author keywords

Clark's rule; Computational biology; Perfect phylogeny haplotyping; Pure parsimony haplotyping

Indexed keywords

BINARY DECISION DIAGRAMS; COMPUTATIONAL COMPLEXITY; LIVING SYSTEMS STUDIES; NUMBER THEORY; PROBLEM SOLVING;

BINARY VECTORS; COMPUTATIONAL BIOLOGY; PERFECT PHYLOGENY HAPLOTYPING; PURE PARSIMONY HAPLOTYPING;

GENETIC ALGORITHMS;

EID: 38349141014     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.camwa.2006.12.089     Document Type: Article

References (28)

1. Chakravarti A. It's raining SNP, hallelujah?. Nature Genetics 19 (1998) 216-217
2. Bonizzoni P., Della Vedova G., Dondi R., and Li J. The haplotyping problem: An overview of computational models and solutions. Journal of Computer Science and Technology 19 1 (2004) 1-23
3. Gusfield D., and Orzack S.H. Haplotype inference. Handbook of Computational Molecular Biology (2005), Chapman and Hall/CRC Press 1-28
4. Gusfield D. A practical algorithm for optimal inference of haplotypes from diploid populations. In: Altman R., Bailey T.L., Bourne P., Gribskov M., Lengauer T., Shindyalov I.N., Ten Eyck L.F., and Weissig H. (Eds). Proceedings of the Annual International Conference on Intelligent Systems for Molecular Biology, ISMB (2000), AAAI Press, Menlo Park, CA 183-189
5. Gusfield D. Inference of haplotypes from samples of diploid populations: Complexity and algorithms. Journal of Computational Biology 8 3 (2001) 305-324
6. Gusfield D. Haplotype inference by pure parsimony. Proceedings of the Annual Symposium on Combinatorial Pattern Matching, CPM. Lecture Notes in Computer Science vol. 2676 (2003), Springer 144-155
7. Lancia G., Pinotti C., and Rizzi R. Haplotyping populations by pure parsimony: Complexity, exact and approximation algorithms. INFORMS Journal on Computing 16 4 (2004) 17-29
8. Brown D.G., and Harrower J.M. A new integer programming formulation for the pure parsimony problem in haplotype analysis. Proceedings of Annual Workshop on Algorithms in Bioinformatics, WABI. Lecture Notes in Computer Science (2004), Springer 254-265
9. Bafna V., Gusfield D., Lancia G., and Yooseph S. Haplotyping as perfect phylogeny: A direct approach. Journal of Computational Biology 10 3-4 (2003) 323-340
10. Eskin E., Halperin E., and Karp R. Efficient reconstruction of haplotype structure via perfect phylogeny. Journal of Bioinformatics and Computational Biology 1 1 (2003) 1-20
11. G. Lancia, R. Ravi, R. Rizzi, Haplotyping for disease association, Technical Report, Dipartimento di Matematica e Informatica, University of Udine, Udine, Italy, 2005 (submitted for publication)
12. Stephens M., Smith N., and Donnelly P. A new statistical method for haplotype reconstruction from population data. American Journal of Human Genetics 68 (2001) 978-989
13. Brualdi A. Introductory Combinatorics (1977), North Holland, New York
14. Clark A. Inference of haplotypes from PCR-amplified samples of diploid populations. Molecular Biology Evolution 7 (1990) 111-122
15. D. Gusfield, Inference of haplotypes from PCR - Amplified samples of diploid populations: Complexity and algorithms, Technical Report cse-99-6, University of California at Davis, Deptartment of Computer Science, Davis, CA, 1999
16. Ausiello G., Crescenzi P., Gambosi G., Kann V., Marchetti-Spaccamela A., and Protasi M. Complexity and Approximation. Combinatorial Optimization Problems and their Approximability Properties (1999), Springer, Berlin
17. E. Hubbel, Unpublished manuscript, 2002
18. Lancia G., and Rizzi R. A polynomial solution to a special case of the parsimony haplotyping problem. Operations Research Letters 34 3 (2006) 289-295
19. Halldórsson B.V., Bafna V., Edwards N., Lippert R., Yooseph S., and Istrail S. A survey of computational methods for determining haplotypes. Computational Methods for SNP and Haplotype Inference: DIMACS/RECOMB Satellite Workshop. Lecture Notes in Computer Science vol. 2983 (2004), Springer 26-47
20. D.G. Brown, J.M. Harrower, A new formulation for haplotype inference by pure parsimony, Technical Report CS-2005-03, University of Waterloo, Department of Computer Science, Waterloo, Canada, 2005
21. K. Kalpakis, P. Namjoshi, Haplotype phasing using semidefinite programming, Technical Report, 2004
22. Y.T. Huang, K.M. Chao, T. Chen, An approximation algorithm for haplotype inference by maximum parsimony, in: ACM Symposium on Applied Computing, SAC, 2005, pp. 146-150
23. Wang L., and Xu Y. Haplotype inference by maximum parsimony. Bioinformatics 19 14 (2003) 1773-1780
24. L. Tininini, P. Bertolazzi, A. Godi, Haplotype inference for large datasets, Technical Report, Istituto dei Sistemi Antonio Ruberti, CNR, Roma, Italy, 2005
25. Hudson R. Gene genealogies and the coalescent process. Oxford Survey of Evolutionary Biology 7 (1990) 1-44
26. Gusfield D. Haplotyping as perfect phylogeny: Conceptual framework and efficient solutions. In: Myers G., Hannenhalli S., Istrail S., Pevzner P., and Waterman M. (Eds). Proceedings of the Annual International Conference on Computational Molecular Biology (RECOMB) (2002), ACM Press, New York, NY 166-175
27. Ding Z., Filkov V., and Gusfield D. A linear-time algorithm for the perfect phylogeny haplotyping problem. Proceedings of the Annual International Conference on Computational Molecular Biology (RECOMB) (2005), ACM Press, New York, NY
28. Greenberg H., Hart W., and Lancia G. Opportunities for combinatorial optimization in computational biology. INFORMS Journal on Computing 16 3 (2004) 1-22