MO640 - Multiple-choice question
The table below specifies 4 species and 4 characters for them, that can undergo state changes of the form 0 -> 1 or 1-> 0.
Identify the FALSE alternative for the mutations in the tree shown besides the table, using maximum parsimony criteria:
| Species | Characters |
| 1 | 2 | 3 | 4 |
| Alpha | 1 | 0 | 0 | 1 |
| Beta | 0 | 0 | 1 | 0 |
| Gamma | 1 | 1 | 0 | 0 |
| Delta | 1 | 0 | 1 | 1 |
|
 |
- For character 3, just one change in this tree is enough to explain all states.
- For character 4, just one change in this tree is enough to explain all states.
- The total number of changes for all characters in a most parsimonious reconstruction of this tree is 5.
- This tree is optimal for the given table.
- None of the above.
Original idea by: Tiago Takamoto
No comments:
Post a Comment