3 problems

Let $k\in\mathbb{N}_{\geq 3}$, let $X$ be a taxon set, and let $T$ and $\widetilde{T}$ be binary phylogenetic trees on $X$. For a binary phylogenetic tree $T$, let $A_k(T)$ denote…

Let $T$ be a binary phylogenetic tree with $n$ leaves, and let $A_k(T)$ denote its induced alignment of characters with parsimony score at most $k$. Theorem characterizes such tree…

Charleston and Steel's conjecture. For $T_k$ and $r\geq 2$,