1 problem

Let $S:=f_1f_2\ldots f_n$ be a sequence of characters (an alignment) on a set $X$ of taxa, with $|X|=m$, and let $\mathcal{T}$ be a maximum parsimony tree for $S$. For a subset…