Inferring evolutionary trees with strong combinatorial evidence

This publication has 29 references indexed in Scilit:

• l∞-Approximation via Subdominants
  Journal of Mathematical Psychology, 2000
• Faster reliable phylogenetic analysis
  Published by Association for Computing Machinery (ACM) ,1999
• A polynomial time algorithm for constructing the refined Buneman tree
  Applied Mathematics Letters, 1999
• On the Interpretation of Bootstrap Trees: Appropriate Threshold of Clade Selection and Induced Gain
  Molecular Biology and Evolution, 1996
• A canonical decomposition theory for metrics on a finite set
  Advances in Mathematics, 1992
• Reconstructing the shape of a tree from observed dissimilarity data
  Advances in Applied Mathematics, 1986
• Computational Complexity of Inferring Phylogenies by Compatibility
  Systematic Zoology, 1986
• Tree structures for proximity data
  British Journal of Mathematical and Statistical Psychology, 1981
• Taxonomy with confidence
  Mathematical Biosciences, 1978
• A note on the metric properties of trees
  Journal of Combinatorial Theory, Series B, 1974