A fast algorithm for the computation and enumeration of perfect phylogenies

SIAM Journal on Computing

Volumn 26, Issue 6, 1997, Pages 1749-1763

  Kannan, Sampath ^a   Warnow, Tandy ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Combinatorial enumeration; Dynamic programming; Evolutionary trees; Perfect phylogeny; Polynomial delay algorithms

Indexed keywords

EID: 0008827068     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794279067     Document Type: Article

References (19)

1. R. AGARWALA AND D. FERNÁNDEZ-BACA, A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed, SIAM J. Comput., 23 (1994), pp. 1216-1224.
2. R. AGARWALA AND D. FERNÁNDEZ-BACA, Fast and Simple Algorithms for Perfect Phylogeny and Triangulating Colored Graphs, DIMACS Tech. Report 94-51, Rutgers University, New Brunswick, NJ, 1994.
3. H. BODLAENDER, M. FELLOWS, AND T. WARNOW, Two strikes against perfect phylogeny, in Proceedings of the 19th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science, Springer-Verlag, New York, 1992, pp. 273-283.
4. H. BODLAENDER AND T. KLOKS, A simple linear time algorithm for triangulating three-colored graphs, J. Algorithms, 15 (1993), pp. 160-172.
5. P. BUNEMAN, A characterization of rigid circuit graphs, Discrete Math., 9 (1974), pp. 205-212.
6. W. H. E. DAY AND D. SANKOFF, Computational complexity of inferring phylogenies by compatibility, Syst. Zool., 35 (1986), pp. 224-229.
7. A. DRESS AND M. STEEL, Convex tree realizations of partitions, Appl. Math. Lett., 5 (1992), pp. 3-6.
8. G. F. ESTABROOK, Cladistic methodology: a discussion of the theoretical basis for the induction of evolutionary history, Ann. Rev. Ecol. Syst., 3 (1972), pp. 427-456.
9. G. F. ESTABROOK, C. S. JOHNSON JR., AND F. R. MCMORRIS, An idealized concept of the true cladistic character, Math. Biosciences, 23 (1975), pp. 263-272.
10. L. A. GOLDBERG, Efficient Algorithms for Listing Combinatorial Structures, Distinguished Dissertation Series, Cambridge University Press, Cambridge, 1993.
11. D. GUSFIELD, Efficient algorithms for inferring evolutionary trees, Networks, 21 (1991), pp. 19-28.
12. S. KANNAN AND T. WARNOW, Triangulating three-colored graphs, SIAM J. Discrete Math., 5 (1992), pp. 249-258.
13. S. KANNAN AND T. WARNOW, Inferring evolutionary history from DNA sequences, SIAM J. Comput., 23 (1994), pp. 713-737.
14. W. J. LE QUESNE, A method of selection of characters in numerical taxonomy, Syst. Zool., 18 (1969), pp. 201-205.
15. W. J. LE QUESNE, Further studies based on the uniquely derived character concept, Syst. Zool., 21 (1972), pp. 281-288.
16. F. R. MCMORRIS, T. WARNOW, AND T. WIMER, Triangulating vertex colored graphs, SIAM J. Discrete Math., 7 (1994), pp. 296-306.
17. D. RINGE, T. WARNOW, AND A. TAYLOR, Character-Based Construction of Evolutionary Trees for Natural Languages, IRCS Tech. Report, University of Pennsylvania, Philadelphia, PA, 1995.
18. M. A. STEEL, The complexity of reconstructing trees from qualitative characters and subtrees, J. Classification, 9 (1992), pp. 91-116.
19. T. WARNOW, Constructing phylogenetic trees efficiently using compatibility criteria, New Zealand J. Botany, 31 (1993), pp. 239-248.