Lecture_4_motifs

It is unlikely that the random star0ng posi0ons will

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: rs to adjust start posi0ons un0l the best profile is found; this is the mo0f. 1 a a a c g t 2 a t a g c g 3 a a c c c t 4 g a a c c t 5 a t a g c t 6 g a c c t g A 1/2 7 a t c c t 7/8 3/8 0 1/8 0 t C 1/8 0 1/2 5/8 3/8 0 8 t a c c t t T 1/8 1/8 0 0 1/4 7/8 A 5/8 5/8 4/8 0 0 0 G 1/4 0 1/8 3/8 1/4 1/8 C 0 0 4/8 6/8 4/8 0 T 1/8 3/8 0 0 3/8 6/8 G 2/8 0 0 2/8 1/8 2/8 Red – frequency increased, Blue – frequency descreased 1.  Select random star0ng posi0ons. 2.  Create a profile P from the substrings at these star0ng posi0ons. 3.  Find the P- most probable L- mer a in each sequence and change the star0ng posi0on to the star0ng posi0on of a. 4.  Compute a new profile based on the new star0ng posi0ons aher each itera0on and proceed un0l we cannot increase the score anymore. Greedy Profile Mo0f Search Analysis Gibbs Sampling •  Since we choos...
View Full Document

This note was uploaded on 02/10/2014 for the course CS 425 taught by Professor Asaben-hur during the Fall '13 term at Colorado State.

Ask a homework question - tutors are online