{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

bio3 - Multiple Alignment 15-853:Algorithms in the Real...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
1 15-853 Page 1 15-853:Algorithms in the Real World Computational Biology III – Multiple Sequence Alignment –Sequencing the Genome 15-853 Page 2 Multiple Alignment A C T _ G T A A C A C G T T A G T G _ T A C C _ G C T A Goal: match the “maximum” number of aligned pairs of symbols. Applications: Assembling multiple noisy reads of fragments of sequences Finding a canonical among members of a family and studying how the members differ The problem is NP-hard 15-853 Page 3 Example Output Output from typical multiple alignment software DNAMAN (using ClustalW ) 15-853 Page 4 Scoring Multiple Alignments 1. Distance from consensus S c : 2. Pairwise distances: 3. Evolutionary Tree Alignment = S S c i i S S D D ) , ( = S S S S S j i i i j S S D D / ) , ( S 1 S 2 S 3 S 4 S 5 ) , ( ) , ( ) , ( ) , ( 45 123 3 12 5 4 2 1 S S D S S D S S D S S D D + + + =
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon