A sufficient condition for reducing recursions in hidden Markov models

DOI10.1007/S11538-005-9045-9zbMATH Open1334.60151OpenAlexW2045219458WikidataQ51939234 ScholiaQ51939234MaRDI QIDQ263604FDOQ263604

Authors: Yun S. Song 

Publication date: 5 April 2016

Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11538-005-9045-9

Recommendations

• The consensus string problem and the complexity of comparing hidden Markov models.
• Distributions associated with general runs and patterns in hidden Markov models
• Maximum-likelihood estimation for hidden Markov models
• Probability Distance Based Compression of Hidden Markov Models
• On reducing the statespace of hidden Markov models for the identity by descent process

zbMATH Keywords

hidden Markov modelMarkov statesrecursionsreductionstatistical alignment

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Computational methods in Markov chains (60J22) Protein sequences, DNA sequences (92D20) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Cites Work

• Biological Sequence Analysis
• Applying the Thorne-Kishino-Felsenstein model to sequence evolution on a star-shaped tree

Cited In (3)

• A note on probabilistic models over strings: the linear algebra approach
• A sequential pruning strategy for the selection of the number of states in hidden Markov models
• Lumpable hidden Markov models -- model reduction and reduced complexity filtering

This page was built for publication: A sufficient condition for reducing recursions in hidden Markov models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q263604)