A Sublinear-Time Randomized Approximation Scheme for the Robinson-Foulds Metric

This publication has 14 references indexed in Scilit:

• The Splits in the Neighborhood of a Tree
  Annals of Combinatorics, 2004
• Database-friendly random projections: Johnson-Lindenstrauss with binary coins
  Journal of Computer and System Sciences, 2003
• A classification of consensus methods for phylogenetics
  Published by American Mathematical Society (AMS) ,2003
• Subtree Transfer Operations and Their Induced Metrics on Evolutionary Trees
  Annals of Combinatorics, 2001
• On computing the nearest neighbor interchange distance
  Published by American Mathematical Society (AMS) ,2000
• Approximate nearest neighbors
  Published by Association for Computing Machinery (ACM) ,1998
• The geometry of graphs and some of its algorithmic applications
  Combinatorica, 1995
• Optimal algorithms for comparing trees with labeled leaves
  Journal of Classification, 1985
• Extensions of Lipschitz mappings into a Hilbert space
  Published by American Mathematical Society (AMS) ,1984
• Comparison of phylogenetic trees
  Mathematical Biosciences, 1981