Global and local alignments Global vs. local alignments Global: - - PowerPoint PPT Presentation

global and local alignments
SMART_READER_LITE
LIVE PREVIEW

Global and local alignments Global vs. local alignments Global: - - PowerPoint PPT Presentation

Global and local alignments Global vs. local alignments Global: align all nucleotides Local: align subsequences with best score Align these sequences: GCAT, GCT (match = 1, mismatch = -1, gap = -1) global alignment: local alignment: ?


slide-1
SLIDE 1

Global and local alignments

slide-2
SLIDE 2

Global vs. local alignments

  • Global: align all nucleotides
  • Local: align subsequences with best score

global alignment: GCAT GC-T Align these sequences: GCAT, GCT (match = 1, mismatch = -1, gap = -1) local alignment:

?

slide-3
SLIDE 3

We can make local alignments using the Smith-Waterman algorithm

Like Needleman-Wunsch, with 2 changes:

  • Don't allow negative scores, set them to 0
  • Backtrack from cell with highest score, stop at 0
slide-4
SLIDE 4

We can make local alignments using the Smith-Waterman algorithm

Like Needleman-Wunsch, with 2 changes:

  • Don't allow negative scores, set them to 0
  • Backtrack from cell with highest score, stop at 0
  • G

C A T

  • 1
  • 2
  • 3
  • 4

G

  • 1

1

  • 1
  • 2

C

  • 2

2 1 T

  • 3
  • 1

1 1 2 Needleman-Wunsch

GCAT GC-T

slide-5
SLIDE 5

We can make local alignments using the Smith-Waterman algorithm

Like Needleman-Wunsch, with 2 changes:

  • Don't allow negative scores, set them to 0
  • Backtrack from cell with highest score, stop at 0
  • G

C A T

  • 1
  • 2
  • 3
  • 4

G

  • 1

1

  • 1
  • 2

C

  • 2

2 1 T

  • 3
  • 1

1 1 2

  • G

C A T

  • G

1 C 2 1 T 1 1 2 Needleman-Wunsch Smith-Waterman

GCAT GC-T GC GC

slide-6
SLIDE 6

We can make local alignments using the Smith-Waterman algorithm

Like Needleman-Wunsch, with 2 changes:

  • Don't allow negative scores, set them to 0
  • Backtrack from cell with highest score, stop at 0
  • G

C A T

  • 1
  • 2
  • 3
  • 4

G

  • 1

1

  • 1
  • 2

C

  • 2

2 1 T

  • 3
  • 1

1 1 2

  • G

C A T

  • G

1 C 2 1 T 1 1 2 Needleman-Wunsch Smith-Waterman

GCAT GC-T GC GC

  • r

GCAT GC-T

slide-7
SLIDE 7

Smith-Waterman algorithm, mathematical form

M(i, j)=max M(i −1, j)+p M(i, j −1)+p M(i −1, j −1)+s(aj,bi) ⎛ ⎝ ⎜ ⎜ ⎜ ⎜ ⎜ ⎞ ⎠ ⎟ ⎟ ⎟ ⎟ ⎟ M(0, j)= 0

first row

M(i,0)= 0

first column top left diagonal s(aj, bi) = match/mismatch score for sites j and i in sequences a and b

slide-8
SLIDE 8

BLAST (Basic Local Alignment Search Tool)

slide-9
SLIDE 9

BLAST is the primary method to find sequences in modern sequence data bases

slide-10
SLIDE 10

Image from: http://www.ncbi.nlm.nih.gov/books/NBK62051/

slide-11
SLIDE 11

Primary BLAST quality metric: E value

The Expectation value or E value represents the number

  • f different alignments with scores equivalent to or

better than the one observed that are expected to occur in a database search by chance. The lower the E value, the more significant the score and the alignment.

slide-12
SLIDE 12

Anatomy of a BLAST result

slide-13
SLIDE 13

Anatomy of a BLAST result

sequence we found (subject sequence)

slide-14
SLIDE 14

Anatomy of a BLAST result

E value

slide-15
SLIDE 15

Anatomy of a BLAST result

number and % of exact matches, near matches, and no matches

slide-16
SLIDE 16

Anatomy of a BLAST result

number and % of exact matches, near matches, and no matches exact match

slide-17
SLIDE 17

Anatomy of a BLAST result

number and % of exact matches, near matches, and no matches near match (positive)

slide-18
SLIDE 18

Anatomy of a BLAST result

number and % of exact matches, near matches, and no matches no match

slide-19
SLIDE 19

Anatomy of a BLAST result