A profile hidden Markov model represents the position-dependent structure of a sequence alignment using an ordered series of match states and optional insertion states, commonly with silent deletion states as well. An emitting state chooses one character from its probability mass function; transitions describe which profile position comes next. If deletion states are forbidden, an alignment column containing gaps cannot be a compulsory match state.
Ancestors (7)
- Hidden Markov model
- Markov process
- Probability theory
- Probability and statistics
- Area of mathematics
- Mathematics
- Home
Incoming links (5)
- Insertion state
- Match state
- Past exam of the mathematical and Computational Biology course of the University of Cambridge / 2024 / Paper 2 / C8 / b / Solution
- Past exam of the mathematical and Computational Biology course of the University of Cambridge / 2025 / Paper 2 / 2 / a / Solution
- Profile hidden Markov model
Discussion (0)
New discussionThere are no discussions about this article yet.
Articles by others on the same topic (0)
There are currently no matching articles.