Combining polynomial running time and fast convergence for the disk-covering method

This publication has 12 references indexed in Scilit:

• Evolutionary trees can be learned in polynomial time in the two-state general Markov model
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Nearly tight bounds on the learnability of evolution
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Fast recovery of evolutionary trees with thousands of nodes
  Published by Association for Computing Machinery (ACM) ,2001
• Efficient algorithms for inverting evolution
  Journal of the ACM, 1999
• The Performance of Neighbor-Joining Methods of Phylogenetic Reconstruction
  Algorithmica, 1999
• A few logs suffice to build (almost) all trees (I)
  Random Structures & Algorithms, 1999
• On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics)
  SIAM Journal on Computing, 1998
• A canonical decomposition theory for metrics on a finite set
  Advances in Mathematics, 1992
• Optimal algorithms for comparing trees with labeled leaves
  Journal of Classification, 1985
• A characterisation of rigid circuit graphs
  Discrete Mathematics, 1974