Evolutionary trees can be learned in polynomial time in the two-state general Markov model

This publication has 10 references indexed in Scilit:

• Nearly tight bounds on the learnability of evolution
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Elements of Information Theory
  Published by Wiley ,2001
• On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics)
  SIAM Journal on Computing, 1998
• Efficient algorithms for inverting evolution
  Published by Association for Computing Machinery (ACM) ,1996
• Recovering a tree from the leaf colourations it generates under a Markov model
  Applied Mathematics Letters, 1994
• On the learnability of discrete distributions
  Published by Association for Computing Machinery (ACM) ,1994
• Reconstructing the shape of a tree from observed dissimilarity data
  Advances in Applied Mathematics, 1986
• Taxonomy with confidence
  Mathematical Biosciences, 1978
• A Probability Model for Inferring Evolutionary Trees
  Systematic Zoology, 1973
• MOLECULAR STUDIES OF EVOLUTION: A SOURCE OF NOVEL STATISTICAL PROBLEMS**This investigation was supported in part by research grant GM 10525-08 from the National Institutes of Health, Public Health Service.
  Published by Elsevier ,1971