Incomplete directed perfect phylogeny

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1848, Issue , 2000, Pages 143-153

  Pe’er, Itsik ^a   Shamir, Ron ^a   Sharan, Roded ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN MATCHING;

BEST-KNOWN ALGORITHMS; FUNDAMENTAL MODELS; N SPECIES; NEAR-OPTIMAL; PERFECT PHYLOGENY; PHYLOGENETIC STUDIES; TIME ALGORITHMS;

BIOLOGY;

EID: 32144440612     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-45123-4_14     Document Type: Article

References (22)

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 Journal on Computing, 23(6):1216-1224, 1994.
2. A. V. Aho, Y. Sagiv, T. G. Szymanski, and J. D. Ullman. Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions. SIAM Journal on Computing, 10(3):405-421, 1981.
3. C. Benham, S. Kannan, M. Paterson, and T.J. Warnow. Hen’s teeth and whale’s feet: generalized characters and their compatibility. Journal of Computational Biology, 2(4):515-525, 1995.
4. H. L. Bodlaender, M. R. Fellows, and T. J. Warnow. Two strikes against perfect phylogeny. In W. Kuich, editor, Proc. 19th ICALP, pages 273-283, Berlin, 1992. Springer. Lecture Notes in Computer Science, Vol. 623.
5. J. H. Camin and R. R. Sokal. A method for deducing branching sequences in phylogeny. Evolution, 19:409-414, 1965.
6. L. Dollo. Le lois de l’évolution. Bulletin de la Societé Belge de Géologie de Paléontologie et d’Hydrologie, 7:164-167, 1893.
7. J. Felsenstein. Inferring Phylogenies. Sinaur Associates, Sunderland, Massachusetts, 2000. In press.
8. L. R. Foulds and R. L. Graham. The Steiner problem in phylogeny is NP-complete. Advances in Applied Mathematics, 3:43-49, 1982.
9. M. C. Golumbic. Matrix sandwich problems. Linear algebra and its applications, 277:239-251, 1998.
10. M. C. Golumbic, H. Kaplan, and R. Shamir. Graph sandwich problems. Journal of Algorithms, 19:449-473, 1995.
11. D. Gusfield. Efficient algorithms for inferring evolutionary trees. Networks, 21:19-28, 1991.
12. D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, 1997.
13. M. Henzinger, V. King, and T.J. Warnow. Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology. Algorithmica, 24:1-13, 1999.
14. J. Holm, K. de Lichtenberg, and M. Thorup. Poly-logarithmic deterministic fullydynamic algorithms for connectivity, minimum spanning tree, 2-edge and biconnectivity. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), pages 79-89, New York, May 23-26 1998. ACM Press.
15. S. Kannan and T. Warnow. A fast algorithm for the computation and enumeration of perfect phylogenies. SIAM Journal on Computing, 26(6):1749-1763, 1997.
16. B. Klinz, R. Rudolf, and G. J. Woeginger. Permuting matrices to avoid forbidden submatrices. Discrete applied mathematics, 60:223-248, 1995.
17. C. A. Meecham and G. F. Estabrook. Compatibility methods in systematics. Annual Review of Ecology and Systematics, 16:431-446, 1985.
18. M. Nikaido, A. P. Rooney, and N. Okada. Phylogenetic relationships among cetartiodactyls based on insertions of short and long interspersed elements: Hippopotamuses are the closest extant relatives of whales. Proceedings of the National Academy of Science USA, 96:10261-10266, 1999.
19. W. J. Le Quesne. The uniquely evolved character concept and its cladistic application. Systematic Zoology, 23:513-517, 1974.
20. M. A. Steel. The complexity of reconstructing trees from qualitative characters and subtrees. Journal of Classification, 9:91-116, 1992.
21. D. L. Swofford. PAUP, Phylogenetic Analysis Using Parsimony (and Other Methods). Sinaur Associates, Sunderland, Massachusetts, 1998. Version 4.
22. M. Thorup. Decremental dynamic connectivity. Journal of Algorithms, 33:229-243, 1999.