Entire BME 480: Ex 1

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/126

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 4:21 AM on 10/11/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

127 Terms

1
New cards
Two sequences have 85% identity. Can we say they are 85% homologous?
No. Homology is shared ancestry, not a percentage.
2
New cards
True or false: Similar sequences must share a common ancestor.
False. Similarity supports but does not prove homology.
3
New cards
Two genes diverged after a species split. Are they orthologs or paralogs?
Orthologs.
4
New cards
Two genes arose through duplication. Are they orthologs or paralogs?
Paralogs.
5
New cards
Two full-length sequences are similar throughout. Which alignment is best?
Global alignment (Needleman-Wunsch).
6
New cards
Only one short region is shared. Which alignment is best?
Local alignment (Smith-Waterman).
7
New cards
One sequence overlaps the end of another. Which alignment is best?
Semi-global alignment.
8
New cards
True or false: Semi-global alignment always penalizes all terminal gaps.
False. Certain terminal gaps are free.
9
New cards
Where does traceback start in global alignment?
Bottom-right cell.
10
New cards
Where does traceback start in local alignment?
The highest-scoring cell anywhere in the matrix.
11
New cards
When does local-alignment traceback stop?
At a cell with score zero.
12
New cards
Why can local alignment never have a negative cell score?
Its recurrence includes zero as an option.
13
New cards
A traceback moves diagonally. What does that mean?
Two residues are aligned: match or mismatch.
14
New cards
A traceback moves horizontally or vertically. What does that mean?
A gap is introduced in one sequence.
15
New cards
True or false: There can be more than one optimal alignment.
True. Tied traceback paths can yield equal scores.
16
New cards
Which penalizes opening a new gap differently from extending one?
Affine gap scoring.
17
New cards
In semi-global alignment, where can the best score occur?
At an allowed endpoint, often the last row or column.
18
New cards
What extra option appears in Smith-Waterman but not Needleman-Wunsch?
Zero.
19
New cards
Why not score all protein substitutions equally?
Some amino acid substitutions are more biologically common than others.
20
New cards
Which matrix uses an explicit evolutionary model: PAM or BLOSUM?
PAM.
21
New cards
Which matrix is built from conserved ungapped blocks?
BLOSUM.
22
New cards
True or false: BLOSUM is derived using ancestral phylogenetic trees.
False.
23
New cards
What does the number in PAM250 describe?
250 PAM1 evolutionary steps.
24
New cards
Which is suited to more divergent sequences: PAM30 or PAM250?
PAM250.
25
New cards
Which is suited to more divergent sequences: BLOSUM80 or BLOSUM45?
BLOSUM45.
26
New cards
True or false: Higher PAM and higher BLOSUM numbers both mean more divergence.
False. Higher PAM means more divergence; higher BLOSUM means a higher identity cutoff.
27
New cards
What does 62 mean in BLOSUM62?
The sequence identity cutoff used for clustering.
28
New cards
A substitution has a positive log-odds score. What does that mean?
It occurs more often than expected by chance.
29
New cards
A substitution has a negative log-odds score. What does that mean?
It occurs less often than expected by chance.
30
New cards
If observed and expected frequencies are equal, what is the log-odds score?
Zero.
31
New cards
What does a diagonal substitution-matrix entry score?
Aligning a residue with itself.
32
New cards
True or false: In a symmetric scoring matrix, S(A,G) = S(G,A).
True.
33
New cards
What is the random-model probability of an ordered pair i,j?
P(i) × P(j).
34
New cards
What is the expected frequency of an unordered pair of different residues?
2 × p(i) × p(j).
35
New cards
Which is a qualitative claim: sequence identity or homology?
Homology.
36
New cards
If a substitution score is high, is that proof of shared ancestry?
No. It means the substitution is favored relative to chance.
37
New cards
Why is BLAST usually faster than running Smith-Waterman on a database?
It uses heuristic seeds and extensions instead of exhaustive alignment.
38
New cards
True or false: BLAST always finds the mathematically optimal local alignment.
False.
39
New cards
Which starts with exact word hits: FASTA or BLAST?
FASTA.
40
New cards
Which can start from similar high-scoring words: FASTA or BLAST?
BLAST.
41
New cards
What happens if FASTA word size increases?
Search generally speeds up but sensitivity decreases.
42
New cards
A BLAST hit has a very low E-value. What does that suggest?
It is unlikely to arise by chance.
43
New cards
Which result is stronger: E = 1e-20 or E = 0.1?
E = 1e-20.
44
New cards
Which result is stronger: bit score 180 or 70?
Bit score 180.
45
New cards
True or false: E-value is the probability that two sequences are homologous.
False. It is the expected number of random hits at least as strong.
46
New cards
What does a high query coverage tell you?
Much of the query sequence is included in the alignment.
47
New cards
What does 90% identity mean?
90% of the aligned positions are identical.
48
New cards
A match covers 5% of a long query with high identity. What should you check?
Query coverage; it may represent only a short shared region.
49
New cards
What does HSP stand for?
High-Scoring Segment Pair.
50
New cards
If the E-value threshold is lowered, what happens to stringency?
It increases.
51
New cards
True or false: Increasing stringency can increase false negatives.
True.
52
New cards
What is a false positive in a homology search?
An unrelated sequence incorrectly reported as a homolog.
53
New cards
What is a false negative in a homology search?
A true homolog missed by the search.
54
New cards
What is BLAST word threshold T used for?
To decide which short word matches qualify as seeds.
55
New cards
What is BLAST drop-off X used for?
To stop extension after the score drops too far.
56
New cards
If the same raw score is searched against a much larger database, what tends to happen to E?
It increases because more random hits are expected.
57
New cards
Which MSA method guarantees the optimal score but is very expensive?
Exact multidimensional dynamic programming.
58
New cards
Which MSA method builds an alignment using a guide tree?
Progressive alignment.
59
New cards
Which MSA method can revisit and improve early decisions?
Iterative alignment.
60
New cards
Which MSA method uses agreement across pairwise alignments?
Consistency-based alignment.
61
New cards
Which MSA method uses known protein 3D structures?
Structure-based alignment.
62
New cards
True or false: Progressive alignment can freely correct all early gap placements.
False.
63
New cards
Why is iterative alignment sometimes more accurate than progressive?
It can revise earlier alignment choices.
64
New cards
You have reliable protein structures. Which MSA approach may help most?
Structure-based alignment.
65
New cards
Which tool is associated with progressive alignment: Clustal or T-Coffee?
Clustal.
66
New cards
Which tool is associated with consistency-based alignment?
T-Coffee.
67
New cards
What does an SP score sum within an MSA column?
Scores of all unique sequence pairs.
68
New cards
How many unique pairs are there among 5 sequences?
5 × 4 / 2 = 10.
69
New cards
What does SPS compare against a reference alignment?
Correctly recovered aligned residue pairs.
70
New cards
What does CS compare against a reference alignment?
Entire correctly reproduced columns.
71
New cards
Which is stricter about exact column agreement: SPS or CS?
CS.
72
New cards
True or false: SPS = 1 means every reference residue pair was recovered.
True.
73
New cards
What does the total height of a sequence-logo stack represent?
Information content at that position.
74
New cards
What determines each letter’s height in a sequence logo?
Its frequency multiplied by the position’s information content.
75
New cards
A logo position has high entropy. Is it highly conserved?
No. High entropy means more variation.
76
New cards
A DNA column contains only A. What are its entropy and information content?
Entropy 0 bits; information content 2 bits.
77
New cards
A DNA column has equal A,C,G,T frequencies. What is its information content?
0 bits.
78
New cards
True or false: More information content means a taller total logo stack.
True.
79
New cards
What is the maximum DNA sequence-logo information content?
2 bits.
80
New cards
What is the maximum protein sequence-logo information content?
log2(20) ≈ 4.32 bits.
81
New cards
Does observed sequence distance always equal the number of substitutions?
No. Multiple changes at one site can be hidden.
82
New cards
A changes to G and back to A. How many differences are observed at the end?
Zero, despite two substitutions.
83
New cards
True or false: p-distance can underestimate evolutionary distance.
True.
84
New cards
What does p-distance measure?
Fraction of compared positions that differ.
85
New cards
Why apply a correction such as Jukes-Cantor?
To estimate hidden substitutions beyond observed differences.
86
New cards
What does a phylogenetic branch length usually represent?
Amount of evolutionary change.
87
New cards
How do you find distance between two tips on a tree?
Sum branch lengths along their connecting path.
88
New cards
What is the first step of UPGMA?
Join the closest pair in the distance matrix.
89
New cards
UPGMA joins two tips separated by distance 8. What is each initial branch length?
4.
90
New cards
Which assumes a molecular clock: UPGMA or Fitch-Margoliash?
UPGMA.
91
New cards
True or false: UPGMA is reliable even when evolutionary rates vary greatly.
False. Its molecular-clock assumption may be violated.
92
New cards
Which method fits branch lengths to pairwise distances: UPGMA or FM?
Fitch-Margoliash.
93
New cards
Does FM require the same constant-rate assumption as UPGMA?
No.
94
New cards
Which method typically produces a rooted ultrametric tree?
UPGMA.
95
New cards
A and B are merged in UPGMA. How is distance to C updated?
Average the distances from members of cluster AB to C.
96
New cards
True or false: A small observed distance always proves a recent common ancestor.
False. Rates and repeated substitutions can complicate interpretation.
97
New cards
What information is lost when sequences are reduced to a distance matrix?
Site-by-site sequence patterns.
98
New cards
For a three-tip tree, what is distance A–B in terms of branches a and b?
a + b.
99
New cards
What does the Markov property say about the next state?
It depends only on the current state.
100
New cards
True or false: A first-order Markov chain needs the entire past to predict the next state.
False.