The multi-state perfect phylogeny problem with missing and removable data: Solutions via integer-programming and chordal graph theory

Journal of Computational Biology

Volumn 17, Issue 3, 2010, Pages 383-399

  Gusfield, Dan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Chordal graphs; Computational biology; Graph triangulation; Infinite allele model; Integer programming; Perfect phylogeny; Phylogenetics; Vertex separators

Indexed keywords

ALGORITHM; ANIMAL; BIOLOGY; CONFERENCE PAPER; PHYLOGENY; STATISTICS; SYSTEM ANALYSIS; TIME;

ALGORITHMS; ANIMALS; COMPUTATIONAL BIOLOGY; PHYLOGENY; PROGRAMMING, LINEAR; STATISTICS AS TOPIC; TIME FACTORS;

EID: 77950856265     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2009.0200     Document Type: Conference Paper

References (28)

1. Agarwala, R., and Fernandez-Baca, D. 1994. A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed. SIAM J. Comput. 23, 1216-1224.
2. Berry, A., Bordat, J.P., and Cogis, O. 1999. Generating all the minimal separators of a graph. Lect. Notes Comput. Sci. 1665, 167-172.
3. Bodlaender, H., Fellows, M., and Warnow, T. 1992. Two strikes against perfect phylogeny. Proc. 19th Int. Colloq. Autom. Lang. Programm. 273-283.
4. Buneman, P. 1974. A characterization of rigid circuit graphs. Discrete Math. 9, 205-212.
5. Dress, A., and Steel, M. 1993. Convex tree realizations of partitions. Appl. Math. Lett. 5, 3-6.
6. Estabrook, G., Johnson, C., and McMorris, F. 1975. An idealized concept of the true cladistic character. Math Biosci. 23, 263-272.
7. Felsenstein, J. 2004. Inferring Phylogenies. Sinauer, Sunderland, MA.
8. Fernandez-Baca, D. 2000. The perfect phylogeny problem. In Du, D.Z., and Cheng, X., eds. Steiner Trees in Industries. Kluwer Academic Publishers, New York.
9. Fernandez-Baca, D., and Lagergren, J. 1996. A polynomial-time algorithm for near-perfect phylogeny. Lect. Notes Comput. Sci. 670-680. (Pubitemid 126097607)
10. Fitch, W. 1975. Towards finding the tree of maximum parsimony, 189-230. In Estabrook, G.F., ed. Proceedings of the Eighth International Conference on Numerical Taxonomy. Freeman, W.H., New York.
11. Gavril, F. 1974. The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Combin. Theory B 16, 47-56.
12. Golumbic, M.C. 1980. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York.
13. Gusfield, D. 1991. Efficient algorithms for inferring evolutionary history. Networks 21, 19-28.
14. Gusfield, D., and Wu, Y. 2009. The three-state perfect phylogeny problem reduces to 2-SAT (to appear in Communication and Information Sciences, 2010).
15. Gusfield, D., Frid, Y., and Brown, D. 2007. Integer programming formulations and computations solving phylogenetic and population genetic problems with missing or genotypic data. Lect. Notes Comput. Sci. 4598, 51-64.
16. Gysel, R., and Gusfield, D. Extensions and improvements to the chorded graph approach to the multi-state perfect phylogeny problem. (Submitted for publication, 2010.)
17. Heggernes, P. 2006. Minimal triangulations of graphs: a survey. Discrete Math. 306, 297-317. (Pubitemid 43289235)
18. Hudson, R. 2002. Generating samples under the Wright-Fisher neutral model of genetic variation. Bioinformatics 18, 337-338. (Pubitemid 34183119)
19. Kannan, S., and Warnow, T. 1994. Inferring evolutionary history from DNA sequences. SIAM J. Comput. 23, 713-737. (Pubitemid 21663265)
20. Kannan, S., and Warnow, T. 1997. A fast algorithm for the computation and enumeration of perfect phylogenies when the number of character states is fixed. SIAM J. Comput. 26, 1749-1763.
21. Lam, F., Gusfield, D., and Sridhar, S. 2009. Generalizing the four gamete condition and splits equivalence theorem: perfect phylogeny on three state characters. Lect. Notes Comput. Sci.
22. McKee, T.A., and McMorris, F.R. 1999. Topics in Intersection Graph Theory. Siam Monographs on Discrete Mathematics.
23. Parra, A., and Scheffler, P. 1995. How to use the minimal separators of a graph for its chordal triangulation. Lect. Notes Comput. Sci. 944, 123-134.
24. Parra, A., and Scheffler, P. 1997. Characterizations and algorithmic applications of chordal graph embeddings. Discrete Appl. Math. 79, 171-188. (Pubitemid 127397245)
25. Pe'er, I., Pupko, T., Shamir, R., et al. 2004. Incomplete directed perfect phylogeny. SIAM J. Comput. 33, 590-607.
26. Satya, R.V., and Mukherjee, A. 2008. The undirected incomplete perfect phylogeny problem. TCBB 5, 618-629.
27. Semple, C., and Steel, M. 2003. Phylogenetics. Oxford University Press, Oxford, UK.
28. Steel, M. 1992. The complexity of reconstructing trees from qualitative characters and subtrees. J. Classif. 9, 91-116.