Presentation is loading. Please wait.

Presentation is loading. Please wait.

Marjolijn Elsinga & Elze de Groot1 Markov Chains and Hidden Markov Models Marjolijn Elsinga & Elze de Groot.

Published byGunner Salyards Modified over 9 years ago

Similar presentations

Presentation on theme: "Marjolijn Elsinga & Elze de Groot1 Markov Chains and Hidden Markov Models Marjolijn Elsinga & Elze de Groot."— Presentation transcript:

1 Marjolijn Elsinga & Elze de Groot1 Markov Chains and Hidden Markov Models Marjolijn Elsinga & Elze de Groot

2 Marjolijn Elsinga & Elze de Groot2 Andrei A. Markov Born: 14 June 1856 in Ryazan, Russia Died: 20 July 1922 in Petrograd, Russia Graduate of Saint Petersburg University (1878) Work: number theory and analysis, continued fractions, limits of integrals, approximation theory and the convergence of series

3 Marjolijn Elsinga & Elze de Groot3 Todays topics Markov chains Hidden Markov models - Viterbi Algorithm - Forward Algorithm - Backward Algorithm - Posterior Probabilities

4 Marjolijn Elsinga & Elze de Groot4 Markov Chains (1) Emitting states

5 Marjolijn Elsinga & Elze de Groot5 Markov Chains (2) Transition probabilities Probability of the sequence

6 Marjolijn Elsinga & Elze de Groot6 Key property of Markov Chains The probability of a symbol x i depends only on the value of the preceding symbol x i-1

7 Marjolijn Elsinga & Elze de Groot7 Begin and End states Silent states

8 Marjolijn Elsinga & Elze de Groot8 Example: CpG Islands CpG = Cytosine – phosphodiester bond – Guanine 100 – 1000 bases long Cytosine is modified by methylation Methylation is suppressed in short stretches of the genome (start regions of genes) High chance of mutation into a thymine (T)

9 Marjolijn Elsinga & Elze de Groot9 Two questions How would we decide if a short strech of genomic sequence comes from a CpG island or not? How would we find, given a long piece of sequence, the CpG islands in it, if there are any?

10 Marjolijn Elsinga & Elze de Groot10 Discrimination 48 putative CpG islands are extracted Derive 2 models - regions labelled as CpG island (‘+’ model) - regions from the remainder (‘-’ model) Transition probabilities are set - Where C st + is number of times letter t follows letter s

11 Marjolijn Elsinga & Elze de Groot11 Maximum Likelihood Estimators Each row sums to 1 Tables are asymmetric

12 Marjolijn Elsinga & Elze de Groot12 Log-odds ratio

13 Marjolijn Elsinga & Elze de Groot13 Discrimination shown

14 Marjolijn Elsinga & Elze de Groot14 Simulation: ‘+’ model

15 Marjolijn Elsinga & Elze de Groot15 Simulation: ‘-’ model

16 Marjolijn Elsinga & Elze de Groot16 Todays topics Markov chains Hidden Markov models - Viterbi Algorithm - Forward Algorithm - Backward Algorithm - Posterior Probabilities

17 Marjolijn Elsinga & Elze de Groot17 Hidden Markov Models (HMM) (1) No one-to-one correspondence between states and symbols No longer possible to say what state the model is in when in xi Transition probability from state k to l: πi is the ith state in the path (state sequence)

18 Marjolijn Elsinga & Elze de Groot18 Hidden Markov Models (HMM) (2) Begin state: a 0k End state: a 0k In CpG islands example:

19 Marjolijn Elsinga & Elze de Groot19 Hidden Markov Models (HMM) (3) We need new set of parameters because we decoupled symbols from states Probability that symbol b is seen when in state k:

20 Marjolijn Elsinga & Elze de Groot20 Example: dishonest casino (1) Fair die and loaded die Loaded die: probability 0.5 of a 6 and probability 0.1 for 1-5 Switch from fair to loaded: probability 0.05 Switch back: probability 0.1

21 Marjolijn Elsinga & Elze de Groot21 Dishonest casino (2) Emission probabilities: HMM model that generate or emit sequences

22 Marjolijn Elsinga & Elze de Groot22 Dishonest casino (3) Hidden: you don’t know if die is fair or loaded Joint probability of observed sequence x and state sequence π:

23 Marjolijn Elsinga & Elze de Groot23 Three algorithms What is the most probable path for generating a given sequence? Viterbi Algorithm How likely is a given sequence? Forward Algorithm How can we learn the HMM parameters given a set of sequences? Forward-Backward (Baum-Welch) Algorithm

24 Marjolijn Elsinga & Elze de Groot24 Viterbi Algorithm CGCG can be generated on different ways, and with different probabilities Choose path with highest probability Most probable path can be found recursively

25 Marjolijn Elsinga & Elze de Groot25 Viterbi Algorithm (2) v k (i) = probability of most probable path ending in state k with observation i

26 Marjolijn Elsinga & Elze de Groot26 Viterbi Algorithm (3)

27 Marjolijn Elsinga & Elze de Groot27 Viterbi Algorithm Most probable path for CGCG

28 Marjolijn Elsinga & Elze de Groot28 Viterbi Algorithm Result with casino example

29 Marjolijn Elsinga & Elze de Groot29 Three algorithms What is the most probable path for generating a given sequence? Viterbi Algorithm How likely is a given sequence? Forward Algorithm How can we learn the HMM parameters given a set of sequences? Forward-Backward (Baum-Welch) Algorithm

30 Marjolijn Elsinga & Elze de Groot30 Forward Algorithm (1) Probability over all possible paths Number of possible paths increases exponentonial with length of sequence Forward algorithm enables us to compute this efficiently

31 Marjolijn Elsinga & Elze de Groot31 Forward Algorithm (2) Replacing maximisation steps for sums in viterbi algorithm Probability of observed sequence up to and including x i, requiring π i = k

32 Marjolijn Elsinga & Elze de Groot32 Forward Algorithm (3)

33 Marjolijn Elsinga & Elze de Groot33 Three algorithms What is the most probable path for generating a given sequence? Viterbi Algorithm How likely is a given sequence? Forward Algorithm How can we learn the HMM parameters given a set of sequences? Forward-Backward (Baum-Welch) Algorithm

34 Marjolijn Elsinga & Elze de Groot34 Backward Algorithm (1) Probability of observed sequence from xi to the end of the sequence, requiring πi = k

35 Marjolijn Elsinga & Elze de Groot35 Disadvantage Algorithms Multiplying many probabilities gives very small numbers which can lead to underflow errors on the computer  can be solved by doing the algorithms in log space, calculating log(v l (i))

36 Marjolijn Elsinga & Elze de Groot36 Backward Algorithm

37 Marjolijn Elsinga & Elze de Groot37 Posterior State Probability (1) Probability that observation x i came from state k, given the observed sequence Posterior probability of state k at time i when the emitted sequence is known: P(π i = k | x)

38 Marjolijn Elsinga & Elze de Groot38 Posterior State Probability (2) First calculate probability of producing entire observed sequence with the ith symbol being produced by state k P(x, π i = k) = f k (i) · b k (i)

39 Marjolijn Elsinga & Elze de Groot39 Posterior State Probability (3) Posterior probabilities will then be: P(x) is result of forward or backward calculation

40 Marjolijn Elsinga & Elze de Groot40 Posterior Probabilities (4) For the casino example

41 Marjolijn Elsinga & Elze de Groot41 Two questions How would we decide if a short strech of genomic sequence comes from a CpG island or not? How would we find, given a long piece of sequence, the CpG islands in it, if there are any?

42 Marjolijn Elsinga & Elze de Groot42 Prediction of CpG islands First way: Viterbi Algorithm -Find most probable path through the model -When this path goes through the ‘+’ state, a CpG island is predicted

43 Marjolijn Elsinga & Elze de Groot43 Prediction of CpG islands Second Way: Posterior Decoding - function: -g(k) = 1 for k Є {A +, C +, G +, T + } -g(k) = 0 for k Є {A -, C -, G -, T - } -G(i|x) is posterior probability according to the model that base i is in a CpG island

44 Marjolijn Elsinga & Elze de Groot44 Summary (1) Markov chain is a collection of states where a state depends only on the state before Hidden markov model is a model in which the states sequence is ‘hidden’

45 Marjolijn Elsinga & Elze de Groot45 Summary (2) Most probable path: viterbi algorithm How likely is a given sequence?: forward algorithm Posterior state probability: forward and backward algorithms (used for most probable state of an observation)

Download ppt "Marjolijn Elsinga & Elze de Groot1 Markov Chains and Hidden Markov Models Marjolijn Elsinga & Elze de Groot."

Similar presentations

. Markov Chains. 2 Dependencies along the genome In previous classes we assumed every letter in a sequence is sampled randomly from some distribution.

. Markov Chains. 2 Dependencies along the genome In previous classes we assumed every letter in a sequence is sampled randomly from some distribution.
Hidden Markov Model in Biological Sequence Analysis – Part 2

Hidden Markov Model in Biological Sequence Analysis – Part 2
HMM II: Parameter Estimation. Reminder: Hidden Markov Model Markov Chain transition probabilities: p(S i+1 = t|S i = s) = a st Emission probabilities:

HMM II: Parameter Estimation. Reminder: Hidden Markov Model Markov Chain transition probabilities: p(S i+1 = t|S i = s) = a st Emission probabilities:
Learning HMM parameters

Learning HMM parameters
Hidden Markov Model.

Hidden Markov Model.
Rolling Dice Data Analysis - Hidden Markov Model Danielle Tan Haolin Zhu.

Rolling Dice Data Analysis - Hidden Markov Model Danielle Tan Haolin Zhu.
Lecture 8: Hidden Markov Models (HMMs) Michael Gutkin Shlomi Haba Prepared by Originally presented at Yaakov Stein’s DSPCSP Seminar, spring 2002 Modified.

Lecture 8: Hidden Markov Models (HMMs) Michael Gutkin Shlomi Haba Prepared by Originally presented at Yaakov Stein’s DSPCSP Seminar, spring 2002 Modified.
Bioinformatics Hidden Markov Models. Markov Random Processes n A random sequence has the Markov property if its distribution is determined solely by its.

Bioinformatics Hidden Markov Models. Markov Random Processes n A random sequence has the Markov property if its distribution is determined solely by its.
Hidden Markov Models Eine Einführung.

Hidden Markov Models Eine Einführung.
Hidden Markov Models.

Hidden Markov Models.
Markov Models Charles Yan 2008. 2 Markov Chains A Markov process is a stochastic process (random process) in which the probability distribution of the.

Markov Models Charles Yan Markov Chains A Markov process is a stochastic process (random process) in which the probability distribution of the.
 CpG is a pair of nucleotides C and G, appearing successively, in this order, along one DNA strand.  CpG islands are particular short subsequences in.

 CpG is a pair of nucleotides C and G, appearing successively, in this order, along one DNA strand.  CpG islands are particular short subsequences in.
Hidden Markov Models Modified from:http://www.cs.iastate.edu/~cs544/Lectures/lectures.htmlhttp://www.cs.iastate.edu/~cs544/Lectures/lectures.html.

Hidden Markov Models Modified from:
Statistical NLP: Lecture 11

Statistical NLP: Lecture 11
Hidden Markov Models Theory By Johan Walters (SR 2003)

Hidden Markov Models Theory By Johan Walters (SR 2003)
Hidden Markov Models Fundamentals and applications to bioinformatics.

Hidden Markov Models Fundamentals and applications to bioinformatics.
Hidden Markov Models. Two learning scenarios 1.Estimation when the “right answer” is known Examples: GIVEN:a genomic region x = x 1 …x 1,000,000 where.

Hidden Markov Models. Two learning scenarios 1.Estimation when the “right answer” is known Examples: GIVEN:a genomic region x = x 1 …x 1,000,000 where.
Hidden Markov Models. Decoding GIVEN x = x 1 x 2 ……x N We want to find  =  1, ……,  N, such that P[ x,  ] is maximized  * = argmax  P[ x,  ] We.

Hidden Markov Models. Decoding GIVEN x = x 1 x 2 ……x N We want to find  =  1, ……,  N, such that P[ x,  ] is maximized  * = argmax  P[ x,  ] We.
Markov Models Charles Yan Spring 2006. 2 Markov Models.

Markov Models Charles Yan Spring Markov Models.
Hidden Markov Models. Two learning scenarios 1.Estimation when the “right answer” is known Examples: GIVEN:a genomic region x = x 1 …x 1,000,000 where.

Hidden Markov Models. Two learning scenarios 1.Estimation when the “right answer” is known Examples: GIVEN:a genomic region x = x 1 …x 1,000,000 where.

Similar presentations

Ads by Google