Parsimony is hard to beat!

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

Volumn 1276, Issue , 1997, Pages 124-133

  Rice, Kenneth ^a   Warnow, Tandy ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY;

BIOMOLECULAR SEQUENCES; DISTANCE-BASED METHODS; EVOLUTIONARY DISTANCE; EVOLUTIONARY HISTORY; NEIGHBOR JOINING; PERFORMANCE ANALYSIS; STATISTICAL POWER; SUBSTITUTION RATES;

TREES (MATHEMATICS);

EID: 84947793322     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0045079     Document Type: Conference Paper

References (26)

1. R. Agarwala, V. Bafna, M. Farach, B. Narayanan, M. Paterson, and M. Thorup. On the approximability of numerical taxonomy: fitting distances by tree metrics. Proceedings of the 7th Annual SODA, 1996.
2. D. J. Atdous, Probability distributions on cladograms, in: Discrete Random Structures, eds. D. J. Aldous and R. Permantle, Springer-Verlag, IMA Vol. in Mathematics and its Applications. Vol. 76, 1-18, 1995.
3. K. Atteson. The performance of the Neighbor-Joining Method of Phylogeny Reconstruction, Proceedings, COCOON 1997 (in this volume).
4. Cavender, J. Taxonomy with confidence, Mathematical Biosciences, 40:271-280, 1978.
5. J. Cohen and M. Farach, Numerical Taxonomy on Data: Experimental Results. SODA '97 and RECOMB '97.
6. W.H.E. Day, Computational complexity of inferring phylogenies from dissimilarity matrices. Bull. of Math. Biol. 49(4):461-467, 1987.
7. W.H.E. Day and D.S. Johnson, The computational complexity of inferring rooted phylogenies by parsimony. Mathematical Biosciences, 81:33-42, 1986.
8. P. L. ErdSs, M. A. Steel, L. A. Székely, and T. J. Warnow, Constructing big trees from short sequences. To appear, Proceedings ICALP 1997.
9. M. Farach, and S. Kannan, Efficient algorithms for inverting evolution, Proceedings of the ACM Symposium on the Foundations of Computer Science, 230-236, (1996).
10. M. Farach, S. Kannan, and T. Warnow. A robust model for finding optimal evolutionary trees. Algorithmica (1995) 13: 155-179.
11. J. Felsenstein, Cases in which parsimony or compatibility methods will be positively misleading, Syst. Zoot. 27 (1978), 401-410.
12. J. Felsenstein, PHYLIP - Phylogeny Inference Package (Version 3.2), Cladistics, 5: 164-166, 1989.
13. L. R. Foulds, R. L. Graham, The Steiner problem in phylogeny is NP-complete, Adv. Appl. Math. 3(1982), 43-49.
14. O. Gascuel, BIONJ: An improved version of the NJ algorithm based on a simple model of sequence data. GERAD Technical Report, G-97-18.
15. D. Hillis, Inferring complex phylogenies, Nature Vol 383 12 September, 1996, 130- 131.
16. D. Hillis, J. Huelsenbeck, and D. Swofford, Hobgoblin of phylogenetics? Nature, Vol. 369, 1994, pp. 363-364.
17. J. Huelsenbeck. Performance of phylogenetic methods in simulation. Syst. Biol. 44(1):17-48, 1995.
18. J. P. Huelsenbeck and D. M. Hillis, Success of Phylogenetic Methods in the Fourtaxon Case, Syst Biol., 42:3 247-264, 1993.
19. J. Kim, General inconsistency conditions for maximum parsimony: effects of branch length and increasing number of taxa, Syst. Biol. 45(3)(1996), 363-374.
20. K. Rice, M. Donoghue, and R. Olmstead, Analyzing large data sets: rbcL revisited, Systematic Biology, to appear, 1997.
21. K. Rice. See the web page http://www.cis.upenn.edu/~rice/progs/ecat.
22. K. Rice, M. Steel, T. Warnow, and S. Yooseph. Getting better topology estimates of difficult evolutionary trees, manuscript.
23. N. Saitou, M. Nei, The neighbor-joining method: a new method for reconstructing phylogenetic trees, Mol. Biol. Evol. 4 (1987), 406-425.
24. D. L. Swofford, PAUP: Phylogenetic analysis using parsimony, version 3.0s. Illinois Natural History Survey, Champaign. 1992.
25. A. Templeton, Human origins and analysis of mitochondrial DNA sequences. Science, Vol. 255, 737-739, 1992.
26. Allan C. Wilson, Rebecca L. Cann, The recent African genesis of humans, Scientific American April 1992, 68-73.