012-2015

MO640 - Multiple-choice question

Consider the phylogenetic trees below.

Assume that C1, C2, C3, and C4 are all binary, unordered characters.  Which of the topologies could be a most parsimonious tree possible for a given input table?

a) I, II, and III
b) I and II only
c) I only
d) III only
e) None of the above

Original Idea by: Mario Akita