Hidden Markov Model Variants and their Application
Open Access
- 26 September 2006
- journal article
- Published by Springer Nature in BMC Bioinformatics
- Vol. 7 (S2) , S14
- https://doi.org/10.1186/1471-2105-7-s2-s14
Abstract
Markov statistical methods may make it possible to develop an unsupervised learning process that can automatically identify genomic structure in prokaryotes in a comprehensive way. This approach is based on mutual information, probabilistic measures, hidden Markov models, and other purely statistical inputs. This approach also provides a uniquely common ground for comparative prokaryotic genomics. The approach is an on-going effort by its nature, as a multi-pass learning process, where each round is more informed than the last, and thereby allows a shift to the more powerful methods available for supervised learning at each iteration. It is envisaged that this "bootstrap" learning process will also be useful as a knowledge discovery tool. For such an ab initio prokaryotic gene-finder to work, however, it needs a mechanism to identify critical motif structure, such as those around the start of coding or start of transcription (and then, hopefully more).Keywords
This publication has 8 references indexed in Scilit:
- Cheminformatics methods for novel nanopore analysis of HIV DNA terminiBMC Bioinformatics, 2006
- Paradoxes of probability theoryPublished by Cambridge University Press (CUP) ,2003
- Biological Sequence AnalysisPublished by Cambridge University Press (CUP) ,1998
- Counting polymers moving through a single ion channelNature, 1994
- Physics and ChancePublished by Cambridge University Press (CUP) ,1993
- Relative InformationPublished by Springer Nature ,1990
- Self-organized criticality: An explanation of the 1/fnoisePhysical Review Letters, 1987
- Nonequilibrium Thermodynamics in BiophysicsPublished by Harvard University Press ,1965