This preview shows page 1. Sign up to view the full content.
Unformatted text preview: = (0 . 24 , . 26 , . 26 , . 24) for { A, C, G, T } . Suppose we know that the sequence S = TCACTATTATCCCTGTTA contains at most one Nanog binding site. Let a be the start position of the site if it exists, and dene a = 0 if S does not contain a site. Only consider the forward strand, i.e., a { , 1 , , 10 } . Assuming that the prior probability ( a = i ) is uniform, calculate P ( a = i  S,X, ) for i = 0 , 1 , , 10. Hint: P ( a = i  S,X, ) P ( S,a = i  X, ) = Z P ( S,a = i  , ) p (  X ) d . 3. Show that the Gibbs sampler is a special case of the MetropolisHastings algorithm. 1...
View Full
Document
 Spring '10
 wu
 Probability

Click to edit the document details