Learning nonsingular phylogenies and hidden Markov models

Annals of Applied Probability

Volumn 16, Issue 2, 2006, Pages 583-614

  Mossel, Elchanan ^a   Roch, Sébastien ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Evolutionary trees; Hidden Markov models; PAC learning; Phylogenetic reconstruction

Indexed keywords

EID: 33746918412     PISSN: 10505164     EISSN: 10505164     Source Type: Journal    
DOI: 10.1214/105051606000000024     Document Type: Article

References (32)

1. ABE, N. and WARMUTH, N. K. (1992). On the computational complexity of approximating probability distributions by probabilistic automata. Machine Learning 9 205-260.
2. AMBAINIS, A., DESPER, R., FARACH, M. and KANNAN, S. (1997). Nearly tight bounds on the learnability of evolution. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science 524-533. IEEE Computer Society, Washington, DC.
3. BLUM, A., FURST, M., JACKSON, J. KEARNS, M., MANSOUR, Y. and RUDICH, S. (1994). Weakly learning DNF and characterizing statistical query learning using fourier analysis. In Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing 253-262. ACM Press, New York.
4. BLUM, A., KALAI, A. and WASSERMAN, H. (2003). Noise-tolerant learning, the parity problem, and the statistical query model. J. ACM 50 506-519. MR2146884
5. CHANG, J. T. (1996). Full reconstruction of Markov models on evolutionary trees: Identifiability and consistency. Math. Biosci. 137 51-73. MR1410044
6. CHOR, B. and TULLER, T. (2005). Maximum likelihood of evolutionary trees is hard. Proceedings of Research in Computational Molecular Biology: 9th Annual International Conference. Lecture Notes in Comput. Sci. 3500 296-310. Springer, Berlin.
7. CRYAN, M., GOLDBERG, L. A. and GOLDBERG, P. W. (2002). Evolutionary trees can be learned in polynomial time in the two-state general Markov model. SIAM J. Comput. 31 375-397. MR1861281
8. DURBIN, R., EDDY, S., KROGH, A. and MITCHISON, G. (1998). Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge Univ. Press.
9. DURRETT, R. (1996). Probability: Theory and Examples, 2nd ed. Duxbury, Belmont, CA. MR1609153
10. ERDOS, P. L., STEEL, M., SZEKELY, L. and WARNOW, T. (1997). A few logs suffice to build (almost) all trees. I. Random Structures Algorithms 14 153-184. MR1667319
11. ERDOS, P. L., STEEL, M. A., SZEKELY, L. A. and WARNOW, T. J. (1999). A few logs suffice to build (almost) all trees. II. Theoret. Comput. Sci. 221 77-118. MR1700821
12. FELSENSTEIN, J. (2004). Inferring Phylogenies. Sinauer, New York.
13. FARACH, M. and KANNAN, S. (1999). Efficient algorithms for inverting evolution. J. ACM 46 437-449. MR1812126
14. FELDMAN, J., O'DONNELL, R. and SERVEDIO, R. (2005). Learning mixtures of product distributions over discrete domains. In Proceedings of 46th Symposium on Foundations of Computer Science 501-510. IEEE Computer Society.
15. FELSENSTEIN, J. (1978). Cases in which parsimony or compatibility methods will be positively misleading. Systematic Zoology 27 410-410.
16. GAREY, M. R. and JOHNSON, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA. MR0519066
17. GOLUB, G. H. and VAN LOAN, C. H. (1996). Matrix Computations, 3rd ed. Johns Hopkins Univ. Press. MR1417720
18. GRAHAM, R. L. and FOULDS, L. R. (1982). Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time. Math. Biosci. 60 133-142. MR0678718
19. HELMBOLD, D., SLOAN, R. and WARMUTH, M. (1992). Learning integer lattices. SIAM J. Comput. 21 240-266. MR1154523
20. HORN, R. A. and JOHNSON, C. R. (1985). Matrix Analysis. Cambridge Univ. Press. MR0832183
21. KEARNS, M. J. (1998). Efficient noise-tolerant learning from statistical queries. J. ACM 45 983-1006. MR1678849
22. KEARNS, M. J., MANSOUR, Y., RON, D., RUBINFELD, R., SCHAPIRE, R. E. and SELLIE, L. (1994). On the learnability of discrete distributions. In Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing 273-282. ACM Press, New York.
23. KEARNS, M. J. and VAZIRANI, U. V. (1994). An Introduction to Computational Learning Theory. MIT Press. MR1331838
24. LYNGS, R. B. and PEDERSEN, C. N. S. (2001). Complexity of comparing hidden Markov models. Proceedings of Algorithms and Computation, 12th International Symposium. Lecture Notes in Comput. Sci. 2223 416-428. Springer, Berlin. MR1917761
25. MOSSEL, E. (2003). On the impossibility of reconstructing ancestral data and phylogenies. J. Comput. Biol. 10 669-678.
26. MOSSEL, E. (2004). Distorted metrics on trees and phylogenetic forests. Preprint. Available at arxiv.org/math.CO/0403508.
27. RABINER, L. R. (1989). A tutorial on hidden Markov models and selected applications in speech recognition. Proceedings of the IEEE 77 257-286.
28. RICE, K. and WARNOW, T. (1997). Parsimony is hard to beat! Proceedings of the Third Annual International Conference on Computing and Combinatorics. Lecture Notes in Comput. Sci. 1276 124-133. Springer, Berlin. MR1616310
29. ROCH, S. (2006). A short proof that phylogenetic tree reconstruction by maximum likelihood is hard. In IEEE/ACM Transactions on Computational Biology and Bioinformaticx 3 92-94.
30. SEMPLE. C. and STEEL, M. (2003). Phylogenetics. Oxford Univ. Press. MR2060009
31. STEEL, M. (1994). Recovering a tree from the leaf colourations it generates under a Markov model. Appl. Math. Lett. 7 19-24. MR1350139
32. VALIANT, L. G. (1984). A theory of the learnable. Comm. ACM 27 1134-1142.