This is a continuation of this question: https://www.chegg.com/homework-help/que
ID: 308374 • Letter: T
Question
This is a continuation of this question: https://www.chegg.com/homework-help/questions-and-answers/question-simple-asks-fill-table-info-supplementary-want-know-go--thanks-apply-method-parsi-q17851818 . I just want to see where to go with this so I don't necessarilly need a complete answer just enough that it's explained. Thanks!
Now that you have your characters, let’s map them onto some trees.
The criteria we’re going to be using to define the “best” tree is called Maximum Parsimony. Map the transitions for the characters you have defined onto the following trees using hashmarks along the branches. Keep in mind the ancestral state of the trait (in the outgroup). You may have to map both appearances (“gains”) and reversions (“losses”) for your traits.
How many character transitions do you have in Tree A? In Tree B? Based on maximum parsimony, which of these trees is better?
On your better tree, can you identify the amino acid that is probably an autapomorphy (unique derived characters)? Symplesiomorphy? Homoplasy (occurred more than once)?
TREE A: outgroup Orangutan Gorilla Chimpanzee Human TREE B: outgroup Gorilla. Chimpanzee Human OrangutanExplanation / Answer
How many character transitions do you have in Tree A? In Tree B? Based on maximum parsimony, which of these trees is better?
On your better tree, can you identify the amino acid that is probably an autapomorphy (unique derived characters)? Symplesiomorphy? Homoplasy (occurred more than once)?
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.