A Polynomial-Time Algorithm for Near-Perfect Phylogeny
Siam Journal On ComputingDavid FernándezBaca +12003Book series
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.
The content you want is available to Zendy users.
Already have an account? Sign inHaving issues? Contact support