Sequence alignment Flashcards

1
Q

Explain global alignment

A

Global alignment aims to maximize the alignment quality over the whole sequences. Gaps are typically penalized.

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

Explain local alignment

A

Local alignment tries to match sub-regions of the sequences. Gaps typically not penalized.

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

List the four possible components of a scoring function

A
  • Match
  • Mismatch
  • Gap
  • Gap extension
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What can you do with a substitution matrix?

A

Substitution matrix can be used to score sequence alignments. It holds all the possible values for a scoring function: points given for each possible match, mismatch, gap and gap extension.

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

Describe the traceback procedure in Smith-Waterman algorithm

A
  1. Start with the highest value in the matrix.*
  2. Trace back until a zero is found

*To break ties, pick the one that yields the longest local alignment.

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

Explain the affine gap penalty scheme

A

In the affine gap penalty scheme, there is a different penalty for opening a gap and extending a gap.

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

How would you check that a high alignment score you just calculated for two sequences did not happen by chance?

A
  1. Create randomized versions of sequence 1.
  2. Align sequence two against the randomized versions.
  3. The fraction of randomized alignment scores that are bigger than the original gives the p-value.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly