A sufficient condition for reducing recursions in hidden Markov models

DOI10.1007/s11538-005-9045-9zbMath1334.60151OpenAlexW2045219458WikidataQ51939234 ScholiaQ51939234MaRDI QIDQ263604

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

zbMATH Keywords

hidden Markov modelreductionMarkov statesrecursionsstatistical alignment

Mathematics Subject Classification ID

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

Related Items (1)

A note on probabilistic models over strings: the linear algebra approach

Cites Work

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

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