7 Optimal Alignment

7 Optimal Alignment - 1 Introduction to Bioinformatics/...

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

View Full Document Right Arrow Icon
1 Introduction to Bioinformatics/ Elements of Bioinformatics Pairwise sequence alignment – Optimal alignment
Background image of page 1

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

View Full DocumentRight Arrow Icon
2 01234567 0 1 2 3 4 5 6 7 A T C C G C G a ATGCGTC b sequence a = A T C C G C G sequence b = A T G C G T C Converting a dotplot to alignments
Background image of page 2
3 01234567 0 1 2 3 4 5 6 7 A T C C G C G a ATGCGTC b Converting a dotplot to alignments Dots can be joined to form diagonals which suggest regions of similarities. Offsets in the diagonals suggest insertions/deletion.
Background image of page 3

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

View Full DocumentRight Arrow Icon
4 01234567 0 1 2 3 4 5 6 7 sequence a = A T C C G C G - - | | | | | sequence b = A T - - G C G T C Score 1+1+0+0+1+1+1+0+0 = 5 Scoring scheme: Match: +1 Mismatch: 0 Gap: 0 A T C C G C G a ATGCGTC b Converting a dotplot to alignments
Background image of page 4
5 sequence a = A T C C G C G -- | | | | | sequence b = A T G C G T C Score 1+1+0+0+1+1+1+0+0 = 5 Diagonal line = align residue in sequence a against residue in sequence b 01234567 0 1 2 3 4 5 6 7 A T C C G C G a ATGCGTC b Converting a dotplot to alignments
Background image of page 5

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

View Full DocumentRight Arrow Icon
6 sequence a = A T C C G C G - - | | | | | sequence b = A T -- G C G T C Score 1+1+0+0+1+1+1+0+0 = 5 Vertical line = adding gap to sequence b; residue in sequence a align to gap in sequence b 01234567 0 1 2 3 4 5 6 7 A T C C G C G a ATGCGTC b Converting a dotplot to alignments
Background image of page 6
7 sequence a = A T C C G C G -- | | | | | sequence b = A T - - G C G T C Score 1+1+0+0+1+1+1+0+0 = 5 Horizontal line = adding gap to sequence a; residue in sequence b align to gap in sequence a 01234567 0 1 2 3 4 5 6 7 A T C C G C G a ATGCGTC b Converting a dotplot to alignments
Background image of page 7

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

View Full DocumentRight Arrow Icon
8 sequence a = A T C C G - C G | | | | | sequence b = A T G C G T C – Score 1+1+0+1+1+0+1+0 = 5 Scoring scheme: Match: +1 Mismatch: 0 Gap: 0 01234567 0 1 2 3 4 5 6 7 A T C C G C G a ATGCGTC b More than one possible alignments
Background image of page 8
9 01234567 0 1 2 3 4 5 6 7 A T C C G C G a ATGCGTC b 48639 possible alignments! How to find the best alignment?
Background image of page 9

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

View Full DocumentRight Arrow Icon
10 Optimal alignment • An optimal alignment is the alignment whose score is at a minimum or a maximum when compared to other alignments using the same scoring parameters. • Optimal alignment is usually obtained by dynamic programming.
Background image of page 10
11 13 possible alignments Score = 0 Scoring scheme: Match: +1 Mismatch: 0 Gap: 0 sequence a --AT sequence b TA-- 012 0 1 2 A T TA a b
Background image of page 11

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

View Full DocumentRight Arrow Icon
12 13 possible alignments sequence a -AT sequence b TA- Score = 1 Scoring scheme: Match: +1 Mismatch: 0 Gap: 0 012 0 1 2 A T TA a b
Background image of page 12
13 sequence a -A-T sequence b T-A- Score = 0 Scoring scheme: Match: +1 Mismatch: 0 Gap: 0 13 possible alignments 012 0 1 2 A T TA a b
Background image of page 13

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

View Full DocumentRight Arrow Icon
14 sequence a -AT sequence b T-A Score = 0 Scoring scheme: Match: +1 Mismatch: 0 Gap: 0 13 possible alignments 012 0 1 2 A T TA a b
Background image of page 14
15 sequence a -AT- sequence b T--A Score = 0 Scoring scheme: Match: +1 Mismatch: 0 Gap: 0 13 possible alignments 012 0 1 2 A T TA a b
Background image of page 15

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

View Full DocumentRight Arrow Icon
16 sequence a A-T sequence b TA- Score = 0 Scoring scheme: Match: +1 Mismatch: 0 Gap: 0 13 possible alignments 012 0 1 2 A T TA a b
Background image of page 16
17 sequence a AT sequence b TA Score = 0 Scoring scheme: Match: +1 Mismatch: 0 Gap: 0 13 possible alignments 012 0 1 2 A T TA a b
Background image of page 17

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

View Full DocumentRight Arrow Icon
18 sequence a AT- sequence b T-A Score = 0 Scoring scheme: Match: +1 Mismatch: 0 Gap: 0 13 possible alignments 012 0 1 2 A T TA a b
Background image of page 18
19 sequence a A--T sequence b -TA- Score = 0 Scoring scheme: Match: +1 Mismatch: 0 Gap: 0 13 possible alignments 012 0 1 2 A T TA a b
Background image of page 19

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

View Full DocumentRight Arrow Icon
20 sequence a A-T sequence b -TA Score = 0 Scoring scheme: Match: +1 Mismatch: 0 Gap: 0 13 possible alignments 012 0 1 2 A T TA a b
Background image of page 20
Image of page 21
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 07/29/2010 for the course BIOC BIOC1805 taught by Professor Dr.brianwong during the Summer '09 term at HKU.

Page1 / 72

7 Optimal Alignment - 1 Introduction to Bioinformatics/...

This preview shows document pages 1 - 21. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online