Hidden Markov Models for Bioinformatics

  • Sisson S
N/ACitations
Citations of this article
37Readers
Mendeley users who have this article in their library.

Abstract

The purpose of this book is to give a thorough and systematic introduction to probabilistic modeling in bioinformatics. The book contains a mathematically strict and extensive presentation of the kind of probabilistic models that have turned out to be useful in genome analysis. Questions of parametric inference, selection between model families, and various architectures are treated. Several examples are given of known architectures (e.g., profile HMM) used in genome analysis. 1. Prerequisites in probability calculus -- 2. Information and the Kullback distance -- 3. Probabilistic models and learning -- 4. EM algorithm -- 5. Alignment and scoring -- 6. Mixture models and profiles -- 7. Markov chains -- 8. Learning of Markov chains -- 9. Markovian models for DNA sequences -- 10. Hidden Markov models: An overview -- 11. HMM for DNA sequences -- 12. Left to right HMM for sequences -- 13. Derin's algorithm -- 14. Forward-backward algorithm -- 15. Baum-Welch learning algorithm -- 16. Limit points of Baum-Welch -- 17. Asymptotics of learning -- 18. Full probabilistic HMM.

Cite

CITATION STYLE

APA

Sisson, S. (2004). Hidden Markov Models for Bioinformatics. Journal of the Royal Statistical Society Series A: Statistics in Society, 167(1), 194–195. https://doi.org/10.1111/j.1467-985x.2004.298_13.x

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free