A polynomial-time algorithm for near-perfect phylogeny
A parameterized version of the Steiner tree problem in phylogeny is defined, where the parameter measures the amount by which a phylogeny differs from "perfection." This problem is shown to be solvable in polynomial time for any fixed value of the parameter.
algorithms phylogeny steiner tree computational biology character-based methods evolutionary trees parsimony perfect phylogeny