This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 1. Eliminate uninformative characters 2. Draw the potential trees 3. Count the number of steps each character requires on each possible tree, and sum them across characters to get a score for each tree 4. Accept as your best hypothesis the tree requiring the fewest steps 5. Root the tree along the branch leading to the outgroup, if that information is provided 6. You now have a rooted, maximum parsimony tree Other methods besides Parsimony to make trees Maximum likelihood is probably the best It includes a much more realistic statistical model of evolution Allows one to calculate the probability that a tree is correct A F G C D B E D G F C A E B Are these two cladograms the same or different? 1. Same 2. Different 3. Can’t tell...
View
Full Document
 Summer '08
 Biology, Cladistics, Phylogeny, Computational phylogenetics, ra c te

Click to edit the document details