Learning nonsingular phylogenies and hidden Markov models

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 366-375

  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

EVOLUTIONARY TREES; HIDDEN MARKOV MODELS; PAC LEARNING; PHYLOGENETIC RECONSTRUCTION;

BOUNDARY CONDITIONS; LEARNING SYSTEMS; MARKOV PROCESSES; MATHEMATICAL MODELS; MATRIX ALGEBRA; POLYNOMIALS;

PROBLEM SOLVING;

EID: 34848926262     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060645     Document Type: Conference Paper

References (30)

1. N. Abe and N. K. Warmuth, On the Computational Complexity of Approximating Probability Distributions by Probabilistic Automata, Machine Learning, 9(2-3), 205-260, 1992.
2. L. Addario-Berry, B. Chor, M. Hallett, J. Lagergren, A. Panconesi and Todd Wareham, Ancestral Maximum Likelihood of Evolutionary Trees Is Hard, Journal of Bioinformatics and Computational Biology, 2, 257-271, 2004.
3. A. Ambainis, R. Desper, M. Farach, and S. Kannan, Nearly tight bounds on the learnability of evolution, FOCS 1997.
4. J. Cavender, Taxonomy with confidence, Mathematical Biosciences, 40, 271-280, 1978.
5. J. T. Chang, Full Reconstruction of Markov Models on Evolutionary Trees: Identifiability and Consistency, Mathematical Biosciences, 137, 51-73, 1996.
6. R. G. Cowell, A. P. Dawid, S. L. Lauritzen, and D. J. Spiegelhalter, Probabilistic Networks and Expert Systems, Springer, New York, 1999.
7. M. Cryan, L. A. Goldberg, and P. W. Goldberg, Evolutionary Trees can be Learned in Polynomial Time in the Two-State General Markov Model, SIAM Journal on Computing, 31(2), 375-397, 2002.
8. R. Durbin, S. Eddy, A. Krogh, and G. Mitchison, Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids, Cambridge University Press, 1998.
9. R. Durrett, Probability: Theory and Examples, Duxbury, 1996.
10. P. L. Erdos, M. Steel, L. Szekely, and T. Warnow, A Few Logs Suffice to Build (Almost) all Trees (I), Random Structures and Algorithms, 14, 153-184, 1997.
11. P. L. Erdos, M. A. Steel, L. A. Szekely, and T. J. Warnow, A Few Logs Suffice to Build (Almost) all Trees (II), Theoretical Computer Science, 221(1-2), 77-118, 1999.
12. J. Felsenstein. Inferring Phytogenies. Sinauer, New York, New York, 2004.
13. M. Farach and S. Kannan, Efficient algorithms for inverting evolution, STOC 1996.
14. J. Feldman and R. O'Donnell and R. Servedio. Learning mixtures of product distributions, preprint, 2004.
15. J. Felsenstein, Cases in which parsimony or compatibility methods will be positively misleading, Systematic Zoology, 27, 410-410, 1978.
16. G. H. Golub and C. H. Van Loan, Matrix Computations, Johns Hopkins University Press, 1996.
17. R. L. Graham and L. R. Foulds, Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time, Mathematical Biosciences, 60, 133-142, 1982.
18. R. A. Horn and C. R. Johnson, Matrix Analysis, Cambridge University Press, 1985.
19. M. Kearns, Efficient noise-tolerant learning from statistical queries, STOC 1993.
20. M. J. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R. E. Schapire, and L. Sellie, On the learnability of discrete distributions, STOC 1994.
21. R. B. Lyngs and C. N. S. Pedersen, Complexity of Comparing Hidden Markov Models, ISAAC 2001.
22. E. Mossel, Distorted metrics on trees and phylogenetic forests, preprint, 2004 (available at http://arxiv.org/math.CO/0403508).
23. E. Mossel and S.Roch, Learning Nonsingular Phylogenies and Hidden Markov Models, preprint, 2005 (available at http://arxiv.org/cs.LG/0502076).
24. L. R. Rabiner, A tutorial on hidden Markov models and selected applications in speech recognition, Proceedings of the IEEE, 77(2), 257-286, 1989.
25. K. Rice and T. Warnow, Parsimony is Hard to Beat, Proceedings of the Third Annual International Conference on Computing and Combinatorics, Lecture Notes In Computer Science, Springer, 1276, 124- 133, 1997.
26. D. Ron, Y. Singer, and N. Tishby, On the Learnability and Usage of Acyclic Probabilistic Finite Automata, J. Comput. Syst. Sci., 56(2), 133-152, 1998.
27. C. Semple and M. Steel. Phylogenetics, volume 22 of Mathematics and its Applications series. Oxford University Press, 2003.
28. M. Steel, Recovering a tree from the leaf colourations it generates under a Markov model, Appl. Math. Lett. 7(2), 19-24, 1994.
29. M. A. Steel, L. A. Szekely, and M. D. Hendy, Reconstructing trees when sequence sites evolve at variable rates, J. Comput. Biol. 1(2), 153-63, 1994.
30. L. G. Valiant, A theory of the learnable, Communications of the ACM, 27(11), 1134-1142, 1984.