A polynomial case of the parsimony haplotyping problem

Operations Research Letters

Volumn 34, Issue 3, 2006, Pages 289-295

  Lancia, Giuseppe ^a   Rizzi, Romeo ^b  

^a UNIVERSITY OF UDINE   (Italy)

^b UNIVERSITY OF TRENTO   (Italy)

Author keywords

Approximation algorithms; Computational biology; Fixed parameter tractability; Parsimony haplotyping; Totally unimodular matrices

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; PARAMETER ESTIMATION; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS; COMPUTATIONAL BIOLOGY; FIXED PARAMETER TRACTABILITY; PARSIMONY HAPLOTYPING; TOTALLY UNIMODULAR MATRICES;

POLYNOMIALS;

EID: 32644447096     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2005.05.007     Document Type: Article

References (15)

1. V. Bafna, D. Gusfield, G. Lancia, and S. Yooseph Haplotyping as perfect phylogeny: a direct approach J. Comput. Biol. 10 3-4 2003 323 340
2. D.G. Brown, J.M. Harrower, A new integer programming formulation for the pure parsimony problem in haplotype analysis, in: Proceedings of Annual Workshop on Algorithms in Bioinformatics (WABI), Lecture Notes in Computer Science, Springer, 2004.
3. A. Chakravarti It's raining SNP, hallelujah? Nat. Genet. 19 1998 216 217
4. R.G. Downey, and M.R. Fellows Parameterized Complexity, Monographs in Computer Science 1999 Springer New York
5. E. Eskin, E. Halperin, and R. Karp Efficient reconstruction of haplotype structure via perfect phylogeny J. Bioinformatics Comput. Biol. 1 1 2003 1 20
6. D. Gusfield A practical algorithm for optimal inference of haplotypes from diploid populations R. Altman T.L. Bailey P. Bourne M. Gribskov T. Lengauer I.N. Shindyalov L.F. Ten Eyck H. Weissig Proceedings of the Annual International Conference on Intelligent Systems for Molecular Biology (ISMB) 2000 AAAI Press Menlo Park, CA 183 189
7. D. Gusfield Inference of haplotypes from samples of diploid populations: complexity and algorithms J. Comput. Biol. 8 3 2001 305 324
8. D. Gusfield, Haplotype inference by pure parsimony, in: Proceedings of the Annual Symposium on Combinatorial Pattern Matching (CPM), Lecture Notes in Computer Science, vol. 2676, Springer, Berlin, 2003, pp. 144-155.
9. I. Heller, and C.B. Tompkins An extension of a theorem of Dantzig's H.W. Kuhn A.W. Tucker Linear Inequalities and Related Systems 1956 Princeton University Press 246 254
10. J.E. Hopcroft, and R.M. Karp An n 5 / 2 algorithm for maximum matchings in bipartite graphs SIAM J. Comput. 2 1973 225 231
11. E. Hubbel, Unpublished manuscript, 2002.
12. International Human Genome Sequencing Consortium, Initial sequencing and analysis of the human genome, Nature 409 (2001) 860-921.
13. G. Lancia, C. Pinotti, and R. Rizzi Haplotyping populations by pure parsimony: complexity, exact and approximation algorithms INFORMS J. Comput. 16 4 2004 17 29
14. V. Vazirani Approximation Algorithms 2001 Springer Berlin
15. J.C. Venter The sequence of the human genome Science 291 2001 1304 1351