Lecture #4: Using Phylogenies Flashcards
LO #1: Describe the basic procedures for building a phylogenetic tree
- select taxa of interest (ingroup)
- include one or more outgroups
- collect data (observations)
- assemble into a data matrix
- select a method of inference (parsimony or statistical methods) ((using unrooted trees))
- root the unrooted tree using the outgroup to produce the phylogeny
LO #2: Explain why unrooted trees are used when building phylogenies
we use unrooted trees b/c the math is better and it makes for very realistic trees (3UN vs 15R for 4 taxa)
LO #3: Contrast ingroup and outgroup
ingroup: the set of organisms under study
outgroup: taxon that is closely related to the ingroup as much as possible, but not be part of it; based on prior knowledge
LO #4: Trace the evolution of a trait on the phylogenetic tree
ex: how did flightless birds evolve? – believe that they are a monophyletic group and that the lost of flight only happened one time
LO #5: Provides examples of how phylogeny is used to inform conservation biology and forensics
conservation biology: giraffes
- different lineages of giraffes, not just one type. so who do you save? what’s your reasoning? –> look at the phylogeny
forensics: HIV at the dentist
- Kimberly Bergalis was a virgin so how? Because the dentist she went to had it and other patients under him contracted the virus and it can be traced back with a phylogeny
concept of building phylogeny: a group of organisms is inferred from their _________
characteristics
concept of building phylogeny: need to collect _____ (through 3 things)
data
- morphology
- genetics
- behavior
concept of building phylogeny: trees are 1. ________ that can be tested by adding more data, taxa w/ 2. _________ _____
- hypotheses
2. analytical methods
the set of organisms under study
ingroups
taxon that is closely related to the ingroup as much as possible, but not be part of it; based on prior knowledge
outgroup
a hypothesis of homology; all characters are assumed to be homologous
data matrix
the best tree is the one w/ the fewest number of character changes
parsimony
rooted –> unrooted
- take away the root branch
- root node gone
- shuffle