Learning Nonsingular Phylogenies and Hidden Markov Models

Loading...
Thumbnail Image
Penn collection
Statistics Papers
Degree type
Discipline
Subject
hidden Markov models
evolutionary trees
phylogenetic reconstruction
PAC learning
Statistics and Probability
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Mossel, Elchanan
Roch, Sébastien
Contributor
Abstract

In this paper we study the problem of learning phylogenies and hidden Markov models. We call a Markov model nonsingular if all transition matrices have determinants bounded away from 0 (and 1). We highlight the role of the nonsingularity condition for the learning problem. Learning hidden Markov models without the nonsingularity condition is at least as hard as learning parity with noise, a well-known learning problem conjectured to be computationally hard. On the other hand, we give a polynomial-time algorithm for learning nonsingular phylogenies and hidden Markov models.

Advisor
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Publication date
2006-01-01
Journal title
The Annals of Applied Probability
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
Comments
Recommended citation
Collection