Constructing phylogenetic trees efficiently using compatibility criteria

New Zealand Journal of Botany

Volumn 31, Issue 3, 1993, Pages 239-248

  Warnow, Tandy J ^a,b  

^a SANDIA NATIONAL LABORATORIES   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Algorithms; Evolution; Phylogenetic tree

Indexed keywords

EID: 25444526825     PISSN: 0028825X     EISSN: 11758643     Source Type: Journal    
DOI: 10.1080/0028825X.1993.10419501     Document Type: Article

References (38)

1. Agarwala, R.; Femandez-Baca, D. in press: A polynomial time algorithm for the perfect phylogeny problem when the number of character states is fixed. SIAM journal on computing.
2. Bodlaender, H.; Fellows, M.; Wamow, T. 1992: Two strikes against perfect phylogeny. Proceedings of the 19th International Congress on Automata Languages and Programming. Berlin, Springer-Verlag. Lecture notes in computer science 623. 273-283.
3. Bodlaender, H.; Kloks, T. 1993: A simple Unear time algorithm for triangulating three-colored graphs. Journal of algorithms 18: 160-172.
4. Brown, W. M.; Prager, E. M.; Wang, A.; Wilson, A. C. 1992: Mitochondrial DNA sequences of primates: tempo and mode of evolution. Journal of molecular evolution 18: 225-239.
5. Buneman, P. 1974: A characterization of rigid circuit graphs. Discrete mathematics 9: 205-212.
6. Camin, J.; Sokal, R. 1965: A method for deducing branching sequences in phylogeny. Evolution 19'. 311-326.
7. Day, W. H. E. 1983: Computationally difficult parsimony problems in phylogenetic systematics. Journal of theoretical biology 103: 429-438.
8. Day, W. H. E.; Sankoff, D. 1986: Computational complexity of inferring phylogenies by compatibility. Systematic zoology 35 (2): 224-229.
9. Day, W. H. E.; Johnson, D. S.; Sankoff, D. 1986: The computational complexity of inferring rooted phylogenies by parsimony. Mathematical biosciences 81'. 33-42.
10. Dress, A.; Steel, M. A. 1992: Convex tree realizations of partitions. Applied mathematics letters 5 (3). 3-6.
11. Edwards, A. W. F.; CavalU-Sforza, L. L. 1963: The reconstruction of evolution. Annals of human genetics 27'. 105.
12. Edwards, A. W. F.; Cavalli-Sforza, L. L. 1964: Reconstruction of evolutionary trees. In'. Hey wood, V. H.; McNeill, J. ed. Phenetic and phylogenetic classification. Systematics Association publication 6: 67-76.
13. Estabrook, G. F. 1972: Cladistic methodology: a discussion of the theoretical basis for the induction of evolutionary history. Annual review of ecology and systematics 3'. 427-56.
14. Estabrook, G. F.; Landrum, L. 1975: A simple test for the possible simultaneous evolutionary divergence of two aminoacid positions. Taxon 24: 609-613.
15. Estabrook, G. F.; McMorris, F. R. 1977: When are two qualitative taxonomic characters compatible? Journal of mathematical biology 4: 195-200.
16. Estabrook, G. F.; Meacham, C. 1985: Compatibility methods in systematics. Annual review of ecology and systematics 16. 431-446.
17. Estabrook, G. F.; Johnson, C. S. Jun.; McMorris, F. R. 1975: An idealized concept of the true cladistic character. Mathematical biosciences 23. 263-272.
18. Felsenstein, J. 1982: Numerical methods for inferring evolutionary trees. The quarterly review of biology 57(4).
19. Felsenstein, J. 1993: PHYLIP (Phylogeny Inference Package) version 3.5c. Distributed by the author. Seattle, Department of Genetics, University of Washington.
20. Fitch, W. M. 1971: Toward defining the course of evolution: minimum change for a specified tree topology. Systematic zoology 20: 406-416.
21. Fitch, W. M. 1995: Toward finding the tree of maximum parsimony. In: Estabrook, G. F. ed. Proceedings of the Eighth International Conference on Numerical Taxonomy. San Francisco, W.H. Freeman. Pp. 189-230.
22. Foulds, L. R.; Graham, R. L. 1982: The Steiner problem in phylogeny is NP-Complete. Advances in applied mathematics 3: 43-49.
23. Garey, M.; Johnson, D. S. 1979: Computers and intractability: a guide to the theory of NP-Completeness. New York, W. H. Freeman and Co.
24. Gusfield, D. 1984: The Steiner tree problem in phylogeny. Technical report 332. Yale University, Department of Computer Science.
25. Gusfield, D. 1991: Efficient algorithms for inferring evolutionary trees. Networks vol 2T. 19-28.
26. Idury, R.; Schaffer, A. 1993: Triangulating three-colored graphs in linear time and linear space. SIAM journal on discrete mathematics 6: 289-294.
27. Kannan, S.; Waraow, T. 1992: Triangulating three-colored graphs. SIAM journal on discrete mathematics 5: 249-258.
28. Kannan, S.; Warnow, T. in press: Inferring evolutionary history from DNA sequences. SIAM journal on computing 23.
29. Kernighan, B.; Ritchie, D. 1988: The C programming language. Englewood Cliffs, New Jersey, Prentice Hall.
30. Kluge, A. G.; Farris, J. S. 1969: Quantitative phyletics and the evolution of anurans. Systematic zoology 18: 1-32.
31. LeQuesne, W. J. 1969: A method of selection of characters in numerical taxonomy. Systematic zoology 18: 201-205.
32. LeQuesne, W. J. 1972: Further studies on the uniquely derived character concept. Systematic zoology 21: 281-288.
33. LeQuesne, W. J. 1974: The uniquely evolved character concept and its cladistic application. Systematic zoology 23: 513-517.
34. LeQuesne, W. J. 1977: The uniquely evolved character concept. Systematic zoology 26: 218-223.
35. McMorris, F. R. 1977: On the compatibility of binary qualitative taxonomic characters. Bulletin of mathematical biology 39: 133-138.
36. McMorris, F. R.; Warnow, T.; Wimer, T. in press: Triangulating vertex colored graphs. SIAMjournal on discrete mathematics 7.
37. Steel, M. A. 1992: The complexity of reconstructing trees from qualitative characters and subtrees. Journal of classification 9: 91-116.
38. Swofford, D. 1993: PAUP (Phylogenetic Analysis Using Parsimony). It can be ordered from the Center for Biodiversity, Illinois Natural History Survey, 607 East Peabody Drive, Champaign, Illinois 61820, U.S.A.