 Hidden Markov Models I Biology 162 Computational Genetics Todd Vision 14 Sep 2004.

Presentation on theme: "Hidden Markov Models I Biology 162 Computational Genetics Todd Vision 14 Sep 2004."— Presentation transcript:

Hidden Markov Models I Biology 162 Computational Genetics Todd Vision 14 Sep 2004

Hidden Markov Models I Markov chains Hidden Markov models –Transition and emission probabilities –Decoding algorithms Viterbi Forward Forward and backward –Parameter estimation Baum-Welch algorithm

Markov Chain A particular class of Markov process –Finite set of states –Probability of being in state i at time t+1 depends only on state at time t (Markov property) Can be described by –Transition probability matrix –Initial probability distribution  0

Markov Chain

Markov chain 123 a 11 a 22 a 12 a 23 a 33 a 21 a 32 a 13 a 31

Transition probability matrix Square matrix with dimensions equal to the number of states Describes the probability of going from state i to state j in the next step Sum of each row must equal 1

Multistep transitions Probability of 2 step transition is sum of probability of all 1 step transitions And so on for n steps

Stationary distribution A vector of frequencies that exists if chain –Is irreducible: each state can eventually be reached from every other –Is aperiodic: state sequence does not necessarily cycle

Reducibility

Periodicity

Applications Substitution models –PAM –DNA and codon substitution models Phylogenetics and molecular evolution Hidden Markov models

Hidden Markov models: applications Alignment and homology search Gene finding Physical mapping Genetic linkage mapping Protein secondary structure prediction

Hidden Markov models Observed sequence of symbols Hidden sequence of underlying states Transition probabilities still govern transitions among states Emission probabilities govern the likelihood of observing a symbol in a particular state

Hidden Markov models

A coin flip HMM Two coins –Fair: 50% Heads, 50% Tails –Loaded: 90% Heads, 10% Tails What is the probability for each of these sequences assuming one coin or the other? A: HHTHTHTTHT B: HHHHHTHHHH

A coin flip HMM Now imagine the coin is switched with some probability Symbol: HTTHHTHHHTHHHHHTHHTHTTHTTHTTH State: FFFFFFFLLLLLLLLFFFFFFFFFFFFFL HHHHTHHHTHTTHTTHHTTHHTHHTHHHHHHHTT HTT LLLLLLLLFFFFFFFFFFFFFFLLLLLLLLLLFFFFF

The formal model where a FF, a LL > a FL, a LF FL H 0.5 T 0.5 H 0.9 T 0.1 a FF a LF a FL a LL

Probability of a state path Symbol: T H H H State: F F L L Symbol: T H H H State: L L F F Generally

HMMs as sequence generators An HMM can generate an infinite number of sequences –There is a probability associated with each one –This is unlike regular expressions With a given sequence –We might want to ask how often that sequence would be generated by a given HMM –The problem is there are many possible state paths even for a single HMM Forward algorithm –Gives us the summed probability of all state paths

Decoding How do we infer the “best” state path? –We can observe the sequence of symbols –Assume we also know Transition probabilities Emission probabilities Initial state probabilities Two ways to answer that question –Viterbi algorithm - finds the single most likely state path –Forward-backward algorithm - finds the probability of each state at each position –These may give different answers

Viterbi algorithm

Viterbi with coin example Let a FF =a LL =0.7, a FL a LF =0.3, a 0 =(0.5, 0.5) T H H H B 1 0 0 0 0 F 0 0.25 0.031250.0182* 0.0115* L 0 0.05 0.0675*0.0425 0.0268  * = F L L L Better to use log probabilities!

Forward algorithm Gives us the sum of all paths through the model Recursion similar to Viterbi but with a twist –Rather than using the maximum state k at position i, we take the sum of all possible states k at i

Forward with coin example Let a FF =a LL =0.7, a FL a LF =0.3, a 0 =(0.5, 0.5) e L (H)=0.9 T H H H B 1 0 0 0 0 F 0 0.25 0.101 ? ? L 0 0.05 0.353? ?

Forward-Backward algorithm

Posterior decoding We can use the forward-backward algorithm to define a simple state sequence, as in Viterbi Or we can use it to look at ‘composite states’ –Example: a gene prediction HMM –Model contains states for UTRs, exons, introns, etc. versus noncoding sequence –A composite state for a gene would consist of all the above except for noncoding sequence –We can calculate the probability of finding a gene, independent of the specific match states

Parameter estimation Design of model (specific to application) –What states are there? –How are they connected? Assigning values to –Transition probabilities –Emission probabilities

Model training Assume the states and connectivity are given We use a training set from which our model will learn the parameters  –An example of machine learning –The likelihood is probability of the data given the model –Calculate likelihood assuming j, j= 1..n sequences in training set are independent

When state sequence is known Maximum likelihood estimators Adjusted with pseudocounts

When state sequence is unknown Baum-Welch algorithm –Example of a general class of EM (Expectation- Maximization) algorithms –Initialize with a guess at a kl and e k (b) –Iterate until convergence Calculate likely paths with current parameters Recaculate parameters from likely paths –A kl and E k (b) are calculated from posterior decoding (ie forward-backward algorithm) at each iteration –Can get stuck on local optima

Preview: Profile HMMs

Reading assignment Continue studying: –Durbin et al. (1998) pgs. 46-79 in Biological Sequence Analysis

Download ppt "Hidden Markov Models I Biology 162 Computational Genetics Todd Vision 14 Sep 2004."

Similar presentations