3. Pairwise alignment Flashcards

1
Q

alignment score

A

is used to measure the quality of the alignment

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

dot plot

A

intrasequence comparison

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

more than 40% identity

A

homology!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

20-40% identity

A

homology probable

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

below 20% identity

A

homology possible but unlikely

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

sliding window approach

A
  • remove noise
  • compare multiple residues at the same time
  • only a dot if nmatcg within wsize
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

best scoring alignment

A

optimal alignment

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

next best scoring alignment

A

suboptimal alignment

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

the optimal alignment is not necessarily

A

correct

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

scoring systems (3)

A
  1. theoretical, count nr of mutations
  2. physiochemical properties
  3. based on evidence from evolution
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Substitution matrices

A

Eg PAM and Blosum

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

PAM stands for

A

point accepted mutation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

PAM

A
  • based on observed aa substitution frequencies
  • logP(aa1->aa2)
  • several matrices, number represent how many accepted mutations
  • 1 PAM - 1 accepted aa change/100 residues
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Blosum

A
  • derived from multiple local alignments
  • should reflecr evolutionary events if alignment is correct
  • eg BLOSUM 62 is a matrix calculated from comparisons of sequences with no more than 62% identical
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

PAM-

Blosum-

A

evolutionary distance

sequence similarity

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

choice of matrix depend on the situation

- distlanty related

A

high PAM nr (eg 250)

Low BLOSUM nr (50)

17
Q

choice of matrix depend on the situation

- closely related

A

low PAM nr (120)

high Blosum nr (eg 80)

18
Q

choice of matrix depend on the situation

- short sequences

A
low low PAM (40)
high Blosum (80)
19
Q

Global

A

looking at entire sequence

should be fairly similar in length

20
Q

Local

A

looking only at a part of sequence, eg domains known to be similar

21
Q

Gap penalties

A

penalised when adding gap to obtain optimal alignment

22
Q

Different gap penalties

A

Gap opening penalty - often higher, when introducing a gap

Gap extension penalty - easier to extend a gap rather than make a new

23
Q

Different gap in different settings

A

high for closely related

low for distantly related

24
Q

dynamic programming

A

algorithm for calculating optimal alignment

25
Q

Needleman-wunch

A

global alignment

26
Q

Smith-waterman

A

local alignment

27
Q

key difference local vs global

A

negatives number will be 0

start traceback from highest number

28
Q

in local what can you do to find suboptimal alignment

A

put the optimal alignment as 0 and recalculate