3 problems

Let $T$ be a binary phylogenetic $X$-tree with $|X|=n$. For a character alignment $A_k(T)$ consisting of the binary characters of parsimony score $k$ on $T$, let…

Let $T$ be a binary phylogenetic $X$-tree with $|X|=n$. For a character alignment $A_k(T)$ consisting of the binary characters of parsimony score $k$ on $T$, let $k<\frac{n}{4}$. M…

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…