Bioinformatics Flashcards

1
Q

What is sequence alignment?

A

The process of lining up two or more sequences to achieve maximal levels of identity

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

Why do we align sequences?

A
  • Assess the degree of similarity
  • Assess possibility of homology
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

How do we computationally find the best alignment?

A

Dynamic programming

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

What is edit distance?

A

A way of quantifying how dissimilar two strings are to one another

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

How do we calculate edit distance?

A

Count the minimum number of edit operations required to transform one into the other

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

What are the different edit operations?

A

Substitution
Deletion
Insertion

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

What are some benefits of the LCS algorithm for pairwise alignment?

A

DNA Strings of equal length are not necessary
Finds longest subsequence common to all sequences
Insertion, deletion allowed
Time and space complexity is O(m * n)

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

What does a substitution matrix describe?

A

The rate at which one character in a sequence changes to others

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

What do global alignment algorithms do?

A

Start at the beginning of two sequences and add gaps until the end of either is reached

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