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

SIAM Journal on Computing

Volumn 31, Issue 2, 2001, Pages 375-397

  Cryan, Mary ^a   Goldberg, Leslie Ann ^b   Goldberg, Paul W ^b  

^a AALBORG UNIVERSITY   (Denmark)

^b UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

Computational learning theory; Evolutionary trees; Learning of distributions; Markov model; PAC learning

Indexed keywords

COMPUTATION THEORY; LEARNING ALGORITHMS; MARKOV PROCESSES; MATHEMATICAL MODELS; POLYNOMIAL APPROXIMATION; PROBABILITY;

PROBABLY APPROXIMATELY CORRECT (PAC) LEARNING;

TREES (MATHEMATICS);

EID: 0036253383     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539798342496     Document Type: Article

References (15)

1. R. AGARWALA, V. BAFNA, M. FARACH, B. NARAYANAN, M. PATERSON, AND M. THORUP, On the approximability of numerical taxonomy (Fitting distances by tree metrics), in Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 1996, pp. 365-372.
2. A. AMBAINIS, R. DESPER, M. FARACH, AND S. KANNAN, Nearly tight bounds on the learnability of evolution, in Proceedings of the 38th Annual IEEE Symposium on the Foundations of Computer Science, 1997, pp. 524-533.
3. N. ABE AND M.K. WARMUTH, Polynomial learnability of probabilistic concepts with respect to the Kullback-Leibler divergence, in Proceedings of the 1992 Conference on Computational Learning Theory, 1992, pp. 277-289.
4. H.J. BANDELT AND A. DRESS, Reconstructing the shape of a tree from observed dissimilarity data, Adv. Appl. Math., 7 (1987), pp. 309-343.
5. J.A. CAVENDER, Taxonomy with confidence, Math. Biosci., 40 (1978), pp. 271-280.
6. T.H. COVER AND J.A. THOMAS, Elements of Information Theory, John Wiley, New York, 1991.
7. P.L. ERDÖS, M.A. STEEL, L.A. SZÉKELY, AND T.J. WARNOW, A Few Logs Suffice to Build (Almost) All Trees I, DIMACS Technical Report 97-71, 1997.
8. P.L. ERDÖS, M.A. STEEL, L.A. SZÉKELY, AND T.J. WARNOW, A Few Logs Suffice to Build (Almost) All Trees II, DIMACS Technical Report 97-72, 1997.
9. (A preliminary version appeared as Inferring big trees from short quartets, in Proceedings of the 24th International Colloquium on Automata, Languages and Programming, 1997, pp. 827-837.)
10. M. FARACH AND S. KANNAN, Efficient algorithms for inverting evolution, in Proceedings of the 28th Annual ACM Symposium on Theory of Computing, 1996, pp. 230-236.
11. J.S. FARRIS, A probability model for inferring evolutionary trees, Syst. Zool., 22 (1973), pp. 250-256.
12. M. KEARNS, Y. MANSOUR, D. RON, R. RUBINFELD, R.E. SCHAPIRE, AND L. SELLIE, On the learnability of discrete distributions, in Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, 1994, pp. 273-282.
13. C. MCDIARMID, On the method of bounded differences, in Surveys in Combinatorics 1989, London Math. Soc. Lecture Note Ser. 141, Cambridge University Press, Cambridge, UK, 1989, pp. 148-188.
14. J. NEYMAN, Molecular studies of evolution: A source of novel statistical problems, in Statistical Decision Theory and Related Topics, S.S. Gupta and J. Yackel, eds., Academic Press, London, 1971, pp. 1-27.
15. M. STEEL, Recovering a tree from the leaf colourations it generates under a Markov model, Appl. Math. Lett., 7 (1994), pp. 19-24.