MAXIMUM LIKELIHOOD Flashcards

1
Q

2 Major components of phylogenetic analysis

A
  1. Phylogeny inference or “tree building”
  2. Character and rate analysis
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

the inference of the branching orders, and ultimately the evolutionary relationships, between “taxa” (entities such as genes, populations, species, etc.)

A

phylogeny inference or “tree building”

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

using phylogenies as analytical frameworks for rigorous understanding of the evolution of various traits or conditions of interest

A

character and rate analysis

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

review common phylogenetic tree terminology and types of trees at d module given

A

ok

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

are mathematical and/or statistical methods for inferring the divergence order of taxa, as well as the lengths of the branches that connect them

A

molecular phylogenetics: tree building methods

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

use the aligned characters, such as DNA or protein sequences, directly during tree inference

A

character-based methods

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

transform the sequence data into pairwise distances and then use the matrix during tree building

A

distance-based methods

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

which tree building method uses character-based and optimality criterion?

A

parsimony
maximum likelihood

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

which tree building method uses distance-based and optimality criterion?

A

minimum evolution
least squares

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

which tree building method uses distance-based and clustering algorithm?

A

UPGMA & NJ

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

having likeliness or resemblance (an observation)

A

similar

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

genetically connected (a historical fact)

A

related

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

types of computational methods

A

clustering algorithm
optimality approaches

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

use pairwise distances

A

clustering algorithm

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

are purely algorithmic methods, in which the algorithm itself defines the tree selection criterion

A

clustering algorithm

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

tend to be very fast programs that produce singular tree rooted by distance

A

clustering algorithm

17
Q

no objective function to compare to other trees, even if numerous other trees could explain the data equally well

A

clustering algorithm

18
Q

REMEMBER: finding a singular tree is not necessarily same as finding the “true” evolutionary tree

19
Q

uses either character or distance data

A

optimality approaches

20
Q

first define an optimality criterions (minimum branch lengths, fewest no. of events, highest likelihood), and then use a specific algorithm for finding trees with the best value for the objective function

A

optimality approaches

21
Q

can identify many equally optimal trees, if such exist

A

optimality approaches

22
Q

REMEMBER: Finding an optimal tree is not necessarily the same as finding the “true” tree

23
Q

this method was first proposed by the English statistician R.A. Fisher in 1922

A

maximum likelihood

24
Q

the probability of observing data under the assumed model will change depending on the parameter values of the model

A

maximum likelihood

25
the aim is to choose the value of the parameter that maximizes the probability of finding the data
maximum likelihood
26
3 main components of maximum likelihood
- data - a model describing the probability of observing the data - a criterion that allows us to move from the data and model to an estimate of the parameters of the model
27
review the simple coin tossing experiment as an example
ok
28
study of different life forms (process of evolution)
phylogenetics
29
reconstruct the evolutionary relationship between species and to estimate the time of divergence between two organisms since they shared a last common ancestor
phylogenetics
30
____ analysis of DNA or protein sequences has become an important tool for studying the evolutionary history of organisms from bacteria to humans
phylogenetics
31
Optimality criterion: NONE. The algorithm itself builds "the" tree.
Clustering Methods (UPGMA & NJ)
32
Advantages: * Can be used on indirectly-measured distances (immunological, hybridization). * Distances can be 'corrected for unsean events. * The fastest of the methods avallable (N-J is screamingly fasti). * Can therefore analyze very large datasets quickly (needed for HIV, etc.). * Can be used for some types of rate and date analysis.
Clustering Methods (UPGMA & NJ)
33
Disadvantages: * Similarity and relationship are not necessarily the same thing, so clustering by similarity does nat necessarily give an evolutionary tree. Cannot be used for character analysis! * Have no explicit optimization criteria, so one cannot even know if the program worked property to find the correct tree for the method.
Clustering Methods (UPGMA & NJ)
34
Optimality criterion: The 'most-parsimonious' tree is the one that requires the fewest number of evolutionary events (e.g., nucleotide substitutions, amino acid replacements) to explain the sequences.
Parsimony Method
35
Advantagos: * Are simple, intuitive, and logical (many possible by 'pencil-and-paper). * Can be used on molecular and non-molecular (e.g., morphological) data. * Can tease apart types of similarity (shared-derived, shared-ancestral, homoplasy) * Can be used for character (can infer the exact substitutions) and rate analysis. * Can be used to infer the sequences of the extinct (hypothetical) ancestors.
Parsimony Method
36
Disadvantages: - simple, intuitive, and logical (derived from "Medieval logic", not statistics!) - can be fooled by high levels of homoplasy ("same" events) - can become positively misleading in the "Felsenstein Zone"
parsimony method
37
Optimality criterion: ML methods evaluate phylogenetic hypotheses in terms of the probability that a proposed model of the evolutionary process and the proposed unrooted tree would give rise to the observed data. The tree found to have the highest ML value is considered to be the preferred tree.
Maximum Likelihood (ML) Methods
38
Advantages: * Are inherently statistical and evolutionary model-based. * Usually the most 'consistent of the methods avaitable. * Can be used for character (can infer the exact substitutions) and rate analysis. * Can be used to infer the sequences of the extinct (hypothelical) ancestors. * Can help account for branch-length eifects in unbalanced trees. * Can be applied to nucleotide or amino acid sequences, and other types of data.
Maximum Likelihood (ML) Methods
39
Disadvantages: * Are not as simple and intuitive as many other methods. * Are computationally very intense (limits number of taxa and length of sequence). * Like parsimony, can be fooled by high levels of homoplasy. * Violations of the assumed model can lead to incorrect trees.
Maximum Likelihood (ML) Methods