Lecture_4_motifs

2 site 3 site 4 site 5 site 6 site 7 consensus w g a

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: rial Defini0on –  MCL- WMR –  Vo0ng –  WINNOWER Posi0on Specific Weight Matrices Site 1 Site 2 Site 3 Site 4 Site 5 Site 6 Site 7 A T T A T T A G G G G G G G A A A A A A A T T T T T T T G T G T G G G G G G G G G G A A A A A A A T T T T T T T G G G C T T T Posi0on Specific Weight Matrices G T G G G G G Site 1 Site 2 Site 3 Site 4 Site 5 Site 6 Site 7 Consensus: W G A T G G A T N G (where W = A or T) •  Randomized algorithms make random rather than determinis0c decisions. •  The main advantage is that no input can reliably produce worst- case results because the algorithm runs differently each 0me. •  These algorithms are commonly used in situa0ons where no exact and fast algorithm is known. G G G G G G G A A A A A A A T T T T T T T G T G T G G G G G G G G G G A A A A A A A T T T T T T T G G G C T T T G T G G G G G Consensus: W G A T G G A T N G PWM represents frequencies of each base at...
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