On the approximability of numerical taxonomy: fitting distances by tree metrics.
Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, 365-372.
The performance of neighbor-joining algorithms of phylogeny reconstruction.
In T. JIANG AND D. LEE Eds., Lecture Notes in Computer Science, 1276, pp. 101-110. Springer-Verlag.
Computing and Combinatorics, Third Annual International Conference, COCOON '97, Shanghai, China, August 1997, Proceedings.
Trees and Proximity Representations.
Wiley.
Inferring evolutionary trees with strong combinatorial evidence.
In T. JIANG AND D. LEE Eds., Lecture Notes in Computer Science, 1276, pp. 111-123. Springer-Verlag.
Computing and Combinatorics, Third Annual International Conference, COCOON '97, Shanghai, China, August 1997 Proceedings.
The recovery of trees from measures of dissimilarity.
In Mathematics in the Archaeological and Historical Sciences, pp. 387-395. Edinburgh University Press.
Constructing big trees from short sequences.
In G. GOOS, J. HARTMANIS, AND J. VAN LEEUWEN Eds., Lecture Notes in Computer Science, Volume 1256.
ICALP'97, 24th International Colloquium on Automata, Languages, and Programming (Silver Jubilee of EATCS), Bologna, Italy, July 7th-11th, 1997.
A few logs suffice to build (almost) all trees I.
DIMACS Technical Report 97-71, submitted to: Random Structures and Algorithms.
Cases in which parsimony or compatibility methods will be positively misleading.
Syst. Zool. 27, 401-410.
PHYLIP--phylogeny inference package (version 3.2).
Cladistics 5, 164-166.
The steiner problem in phylogeny is NP-complete.
Adv. Appl. Math. 3, 43-49.
Inferring complex phylogenies.
Nature 383, 130-131.
Application and accuracy of molecular phylogenies.
Science 264, 671-677.
Performance of phylogenetic methods in simulation.
Syst. Biol. 44, 17-48.
The robustness of two phylogenetic methods: four-taxon simulations reveal a slight superiority of maximum likelihood over neighbor-joining.
Mol. Biol. Evol. 12, 5, 843-849.
Success of phylogenetic methods in the four-taxon case.
Syst. Biol. 42, 247-264.
Evolution of protein molecules.
In H. MUNRO Ed., Mammalian Protein Metabolism, pp. 21-132. Academic Press.
A simulation comparison of phylogeny algorithms under equal and unequal evolutionary rates.
Mol. Biol. Evol. 11, 459-468.
Trends in Ecology and Evolution 12, 2, 49-50.
Taxon sampling and the accuracy of large phylogenies.
To appear in: Systematic Biology.
ECAT, an evolution simulator.
http://www.cis.upenn.edu/
krice.
Analyzing large datasets: rbcl 500 revisited.
Systematic Biology.
Parsimony is hard to beat!
In T. JIANG AND D. LEE Eds., Lecture Notes in Computer Science, 1276, pp. 124-133. Springer-Verlag.
Proceedings, Computing and Combinatorics, Third Annual International Conference, COCOON '97, Shanghai, China, August 1997.
Relative efficiencies of the Fitch-Margoliash, maximum parsimony, maximum likelihood, minimum evolution, and neighbor-joining methods of phylogenetic tree construction in obtaining the correct tree.
Mol. Biol. Evol. 6, 514-525.
The neighbor-joining method: a new method, for reconstructing phylogenetic trees.
Mol. Biol. Evol. 4, 406-425.
Performance of maximum likelihood, neighbor-joining, and maximum parsimony methods when sequence sites are not independent.
Syst. Biol. 44, 4, 533-547.
Relative efficiencies of the maximum parsimony and distance-matrix methods in obtaining the correct phylogenetic tree.
Mol. Biol. Evol. 5, 3, 393-311.
Accuracy of neighbor-joining for n-taxon trees.
Syst. Biol. 45, 4, 516-523.
PAUP: Phylogenetic analysis using parsimony, version 3.0s.
Tree compatibility and inferring evolutionary history.
J. of Algorithms 16, 388-407.
Some combinatorial problems in phylogenetics.
To appear in the proceedings of the International Colloquium on Combinatorics and Graph Theory, Balatonlelle, Hungary, July 15-20, eds. A. Gyárfás, L. Lovász, L.A. Székely, in a forthcoming volume of Bolyai Society Mathematical Studies.
Additive evolutionary trees.
Journal Theoretical Biol. 64, 199-213.