S2: W6 (Dr. Hanlie) Flashcards
(133 cards)
1
Q
Thing to note on genome size?
A
Size of genome doesn’t reflect the ¹complexity & ²size of organisms.
2
Q
Whole genome DNA extraction attributes? (2)
A
• From various tissues like blood, body fluids.
• Extract whole genome of organism.
3
Q
Why extract the whole genome/DNA?
A
It’s because you want to examine a piece of the DNA.
4
Q
How to examine piece of DNA?
A
PCR.
5
Q
What does PCR do?
A
It amplifies (clones) the desired piece/region of DNA.
6
Q
PCR process steps? (3)
A
• Denaturation.
• Annealing.
• Elongation.
7
Q
Primers attributes? (3)
A
• 30-50 bp.
• Forward primer (5’—3’).
• Reverse primer (3’—5’).
8
Q
Purpose of primers?
A
To go anneal to your DNA region of interest just before your region.
9
Q
Gel electrophoresis attribute?
A
Bands producing ladder is the no. of bp.
10
Q
Types of sequencing? (2)
A
• DNA sequencing (Sanger method).
• Next-Generation sequencing.
11
Q
DNA sequencing (Sanger method) attributes? (2)
A
• For standard PCR.
• Electrogram results at the end.
12
Q
Next-Generation sequencing?
A
= amplifying multiple gene regions simultaneously.
13
Q
What does the choice of sequencing method depend on? (2)
A
• Research goals.
• Budget.
14
Q
Why use molecular characters to study evolutionary patterns? (2)
A
• Homoplasy.
• Rare events.
15
Q
Explain Homoplasy as a reason we use molecular data to study evolutionary patterns?
A
Not misled by convergence in morphological characters.
16
Q
Explain Rare events as a reason we use molecular data to study evolutionary patterns? (2)
A
• Show duplications, insertions/deletions, rearrangements.
• Very informative as they are not seen in ecology & morphology.
17
Q
Why is homoplasy problematic in molecular data? (2)
A
• Only 4 bases (A, T, G, C).
• Mutations are common (and you have to track them).
18
Q
Gene/Region alignment?
A
= statement of homology.
19
Q
Why do we do Gene/Region alignment?
A
It’s because we are looking to group similar things together.
20
Q
Why could deletions be informative? (2)
A
• Give information on gene region of interest.
• Give information on species.
21
Q
Gene vs Gene region vs Gene fragment?
A
● Gene
= theoretical region.
● Gene region
= can incorporate many genes & is relative.
● Gene fragment
= piece of a gene.
- When in doubt, just use the word “region”.
22
Q
Kinds of DNA to consider using for phylogenetic study? (3)
A
• Mitochondrial.
• Chloroplast.
• Nuclear.
23
Q
mtDNA attributes? (3)
A
• Maternally inherited (usually).
• Circular.
• Evolves faster than nuclear genes.
24
Q
cpDNA attributes? (2)
A
• Maternally inherited (usually).
• Circular.
25
nDNA attributes? (3)
• Biparentally inherited.
• Linear chromosome.
• Evolve very slowly, thus have slow evolutionary patterns.
26
Why are mtDNA usually maternally inherited?
It's because sperm lose their mitochondria during fertilization.
27
What does your choice of DNA depend on?
Your research question.
28
Eg of where choice of DNA is important?
If you want to get the family history of dogs, use nuclear DNA.
29
mtDNA in plants attributes? (4)
• Circular.
• Maternally inherited.
• Very unstable.
• Highly variable (many rearrangements).
30
Why are mtDNA of plants very unstable?
It's not informative.
31
Which DNA type is informative in plants?
cpDNA.
32
rRNA genes attributes? (3)
• Highly conserved coding region.
• Useful at family level & higher.
• Contains small subunit & large subunit.
33
How do you choose which region to use?
Depends on what research question you want to use (eg in Forensics, Conservation).
34
Thing to note on "How do you choose which region to use"?
When examining the speed of mutations, look at the gene region, particularly the mtDNA & nDNA. The deeper the relationships, the slower the mutations.
35
When examining speed of mutations, what do we look at?
The gene regions, particularly the mtDNA & nDNA.
36
mtDNA attributes in terms of speed of mutation? (2)
• Faster mutation rates.
• Individual & population level.
37
nDNA attributes in terms of speed of mutations? (2)
• Slow mutation rates.
• Family level to deeper relationships (very old origin).
38
Applications of molecular phylogenetic studies? (6)
• Clarify monophyly & the classification/delimitation of taxa (eg. genera, species).
• Interpretation of morphological evolutionary patterns.
• Trace the evolutionary history a species & explain current distribution (phylogeography).
• Provide a basis for interpretation of modes of speciation.
• Provide a basis for conservation prioritization.
• Enable tracing of sources of human diseases.
39
Eg of 1st Application of molecular phylogenetic studies?
Olive Ridley sea turtles vs Kemp's sea turtle.
40
What could it mean when you have incongruence between nuclear & organelle (mt/cp) genomes?
Could be hybridization and/or introgression.
41
What do you mean when you say "Incongruence between nuclear & organelle genomes"?
We mean that the phylogenies of nuclear DNA & mt/cp DNA don't match.
42
Why are more sequences not enough?
Chloroplast capture hypothesis.
43
Chloroplast capture hypothesis?
= where you have inter-species hybridization & subsequent backcrosses.
44
Result of Chloroplast capture hypothesis?
You have a new combination of nuclear & chloroplast genomes.
45
Thing to note on Incongruency?
Just know that there are many reasons for incongruency & know what to do when you do get incongruency.
46
What do different Phylogenetic Inferences (PI) depend on? (2)
• Data that you're working with.
• Research question.
47
Types of PI methods? (4)
• Neighbour joining (NJ).
• Maximum Parsimony (MP).
• Maximum Likelihood (ML).
• Bayesian Inference (BI).
48
PI methods attributes? (5)
• Different techniques to reconstruct evolutionary relationships.
• Employ different algorithms.
• Common inference methods include: NJ, MP, ML & BI.
• Different criteria, assumptions & interpretations.
• Each with own pros & cons.
49
What do you by "Employ different algorithms"? (2)
We mean that they are either:
• based on underlying principles.
• based on computational requirements.
50
NJ attributes? (5)
• Distance method.
• Accounts for the rate of evolution.
• Based on substitution models (at nucleotide/amino acid sites) to estimate genetic distance from sequence data.
• Outdated.
• Branch lengths represent distance, not specific mutations.
51
"Neighbour" from NJ?
= involves closely or distantly related species.
52
Types of distance? (2)
• NJ.
• UPGMA.
53
UPGMA?
= distance method that accounts for a constant rate of evolution (all branches of equal length).
54
Types of clustering? (2)
• K-means clustering.
• Hierarchical clustering.
55
K-means clustering?
• requires the no. of pre-defined clusters (you tell it).
56
Hierarchical clustering?
• gives you a dendrogram (it tells you the number of clusters).
57
Distance method vs Clustering method?
● Distance method
= takes into account the evolutionary processes.
● Clustering method
= doesn't take into account the evolutionary processes.
58
NJ Pros? (5)
• Speed & efficiency.
• Robustness to model assumptions.
• Versatility.
• Interpretability.
• Ease of implementation.
59
Explain speed & efficiency as NJ pro?
It's suitable for large datasets, heuristic nature & can handle high dimensional distance matrices.
60
Explain Robustness to model assumptions as NJ pro?
It's less sensitive to model misspecification or violations due to there being no complex evolutionary models used.
61
Explain versatilility as NJ pro?
You have a wide range of distance matrices.
62
Explain Interpretability as NJ pro?
Branch length is proportional to the estimated distances between taxa.
63
Explain Ease of implementation as NJ pro?
It's some to interpret & understand with limited computational resources/expertise.
64
NJ Cons? (5)
• Sensitive to long branch attraction.
• Lack of statistical support.
• Inability to incorporate evolutionary models.
• Limited accuracy.
• Dependence on distance metrics.
65
Explain Sensitive to long branch attraction as NJ con?
It's a potentially biased phylogenetic inference as it doesn't consider mutations individuals.
66
Explain Lack of statistical support as NJ con?
There's no confidence in the inferred tree topologies.
67
Explain Inability to incorporate evolutionary models as NJ con?
It doesn't consider ¹substitution rate heterogeneity among sites, ²potential biased estimates of branch lengths & ³evolutionary relationships.
68
Explain Limited accuracy as NJ con?
Seen in datasets with complex evolutionary patterns/high levels of sequence divergence.
69
Explain Dependence on distance metrics as NJ con?
Dependence on distance metrics is unreliable as these vary depending on the biological system under study.
70
MP attributes? (6)
• Character-based approach.
• Based on optimality criterion of Parsimony (minimum tree length).
• Branch lengths represent the no. of mutations.
• Unique mutations are not informative.
• Prone to long branch attraction.
• Only synapomorphies are used for Parsimony information (relationships become important).
71
Steps involved in MP? (2)
• Searches for the tree topology with the lowest parsimony score (unrooted).
• Optimizes character states across taxa to construct the phylogenetic tree.
72
Thing to note on Steps involved in MP?
Wants the shortest route possible.
73
MP assumption?
We have evidence of every mutation.
74
Long branch attraction attributes? (2)
• Homoplasy on long branches looks like shared mutations.
• The more data you collect, the more the wrong tree.
75
MP pros? (5)
• Intuitive interpretation.
• Robustness to model assumptions.
• Applicability to diverse data types.
• Computationally efficient for small-medium sized datasets.
• Ease of interpretation.
76
Explain Intuitive interpretation as MP pro?
It's straightforward & aims to reconstruct the tree topology with the fewest evolutionary change.
77
Explain Robustness to model assumptions as MP pro?
It's less sensitive to model misspecification as there are no complex evolutionary models.
78
Explain Applicability to diverse data types as MP pro?
It can analyze different types of data.
79
Explain Ease of interpretation as MP pro?
Accessible to research using computational resources/expertise.
80
MP Cons? (5)
• Sensitivity to Homoplasy.
• Potentially suboptimal solutions.
• Inability to incorporate evolutionary rates.
• Limited statistical support.
• Not suitable for evolutionary testing.
81
Explain Sensitivity to homoplasy as MP con?
It assumes that similar character states are due to shared ancestry.
82
Explain Potentially suboptimal solutions as MP con?
Converge due to the heuristic nature of the search process, especially for large or complex datasets.
83
Explain Inability to incorporate evolutionary rates as MP con?
It doesn't consider the ¹rate of evolution/variation among sites, ²potential for biased estimates of branch lengths & ³divergence times.
84
Explain Limited statistical support as MP con?
It's challenging to assess the robustness of the inferred phylogeny.
85
Explain Not suitable for evolutionary testing as MP con?
It's due to the reliance on parsimony score.
86
Differences between NJ & MP? (2)
• Branch lengths.
• Node support.
87
NJ vs MP in terms of node support?
● NJ
= bootstrap values indicating the proportion of times a particular clade is recovered in bootstrap replicates.
● MP
= assess support for nodes based on alternative analyses or additional statistical tests.
88
NJ node support?
Bootstrap values indicate the proportion of times a particular clade is recovered in bootstrap replicates.
89
MP Node support?
Assesses support for nodes based on alternative analyses or additional statistical tests.
90
NJ vs MP in terms of branch lengths?
● NJ
= represents distances, not specific mutations.
● MP
= represents the no. of mutations.
91
Which is better NJ or MP?
It depends on your research objectives.
92
Why does choosing NJ or MP depend on my research objectives? (4)
You have to consider:
• Underlying principles & model assumptions.
• Data characteristics.
• Computational requirements.
• Trade-offs between accuracy & efficiency.
93
NJ vs MP in terms of the underlying principles & model assumptions?
● NJ
= distance based.
● MP
= character based.
94
NJ vs MP in terms of computational requirements?
● NJ
= computationally efficient.
● MP
= computationally intensive.
95
Why is MP computationally intensive?
It's because it involves complex heuristic search strategies.
96
Model evolution?
= estimates of the relative probability of substitutions.
97
What do the estimates of model evolution need information on? (4)
• Relative proportion of nucleotides.
• Relative frequency of transitions & transversions.
• Frequency of invariant sites.
• Differences in mutation rates between sites.
98
ML & BI attributes? (6)
• Incorporate model selection.
• Optimize models while constructing the trees.
• Operate based on likelihood & probability.
• Incorporate complex substitution models.
• Not sensitive to long branch attraction.
• Always the best to use.
99
Phylogenetic Inference = ...?
A hypothesis no matter how complex it is, it still remains a hypothesis.
100
NJ use "criteria"? (2)
• Distance related.
• If you can account for long branch attraction.
101
ML node support attributes? (2)
• Value tells you how closely related taxa are (sister taxa).
• Uses bootstrap method (value out of 100).
102
BI node support attributes? (4)
• Probabilities.
• Value of 1 is great.
• 0.9-0.95 is trustworthy.
• <0.9 is unresolved.
103
BI node support of < 0.9?
Unresolved. You cannot trust the relationship between species.
104
BI node support of 0.9-0.95?
You can trust the relationship between species.
105
ML & BI in terms of branch length?
Branch length represents the properties of substitutions.
106
Likelihood in ML?
= used to evaluate different trees.
107
Probability?
108
NJ uses which model?
Jukes-Cantor (JC) model (simple substitution level).
109
Criteria for estimating the relative probabilities? (4)
Must have information on:
• Relative proportion of nucleotides (A:C:G:T).
• Relative frequency of transitions & transversions.
• Frequency of invariant sites.
• Differences in mutation rates between sites can vary (model dependent).
110
What make ML & BI special? (7)
• Probabilistic methods.
• Maximize the likelihood of observed sequence data under specified substitution model.
• Substitution models are more complex & flexible.
• Directly optimize model parameter during tree construction.
• Can handle wide range of evolutionary scenarios.
• Preferred for accurate model parameter estimation.
• Computationally intensive, especially for large datasets & time-consuming.
111
ML "method"/equations? (3)
● You'd like to know:
P (tree|data)
* i.e., what is the likelihood of tree give the data.
● To do this, you need to consider ALL possible trees
= not feasible for >10 taxa.
● So, we calculate:
P (data|tree)
* I.e., probability of this data given a specific tree (which tree suits the data).
112
ML equations to note? (2)
● P (tree|data)
● P (data|tree)
113
ML attributes? (5)
• Powerful method used extensively in statistics.
• Prefers hypotheses (tree) with the highest probability given the observed data.
• Very computationally intensive for phylogenies.
• Corrects multiple hits & removes the danger of long branch attraction.
• Accurately reconstructs relationships in diverged groups or groups evolving rapidly.
114
What must you be given for ML to produce the preferred tree? (2)
• Dataset (an alignment).
• A model of character evolution.
115
What is the preferred tree in ML?
= the tree that has the highest probability of having generated the observed data.
116
Probability of data given the tree definition?
= when the best tree is the one that maximizes the likelihood of the data given the ¹tree topology, a ²set of branch lengths & an ³evolution model.
117
BI attributes? (4)
• Probability of the tree given the data.
• Estimates trees & obtains measures of uncertainty for each branch.
• Optimal hypothesis maximizes the posterior probability (by measuring all its uncertainties).
• Posterior probability for a hypothesis is proportional to likelihood multiplied by the prior probability of that hypothesis.
118
Posterior probability?
= the end goal.
119
Prior probability?
= a scientist's beliefs before having seen the data.
120
Eg of prior probability?
Roll of dice.
121
How does ML optimize parameters?
Optimizes parameters using numerical optimization algorithm.
122
How does BI optimize parameters?
Optimizes parameters using MCMC sampling.
123
Bayesian approach attributes? (9)
• Allows complex models of sequence evolution to be implemented.
• Doesn't need bootstrapping to assess confidence in the nodes.
• Reports on posterior probabilities for branches.
• Feed it lots of prior information to get posterior probability.
• Specifies a model & prior distribution.
• Integrates the product of these qualities over all possible parameter values to determine posterior probability for each tree.
• Relies on MCMC to approximate probability distribution.
• Chain is constructed that moves through different trees & evolution models.
• Estimates probability that any particular tree is the true evolutionary tree for the observed data.
124
MCMC stands for?
Markov Chain Monte Carlo.
125
BI equations? (3)
● Eqn 1
P [tree|data] = P [tree & data] / P [data]
● Eqn 2
P [tree|data] = P [tree] × P [data|tree]
● Eqn 3
• obtained by substituting Eqn 2 into Eqn 1.
P [tree|data] = ( P [tree] × P [data|tree] ) / P [data]
126
P [tree|data] ?
= probability of tree is true given the data.
127
P [tree & data] ?
= joint probability of the particular tree & data (alignment).
128
Joint probability equation?
P [tree|data] = P [tree] × P [data|tree]
129
Joint probability?
= the product of the probability of the tree & conditional probability of the data given that tree.
130
Bayes theorem equation simply?
Bayes theorem = posterior probability × prior probability.
131
Joint probability equation simply?
Joint probability = posterior probability × prior probability = Bayes theorem
132
P [tree] ?
= the posterior probability.
133
P [data|tree] , i.e., conditional probability?
= prior probability.
