Back to Results
First PageMeta Content
Computational complexity theory / Graph theory / Mathematics / Phylogenetics / NP-complete problems / Computational phylogenetics / Analysis of algorithms / Probabilistic complexity theory / Randomized algorithm / Steiner tree problem / Algorithm / Maximum parsimony


LNCSFixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction
Add to Reading List

Document Date: 2009-01-01 08:42:54

Open Document

File Size: 402,58 KB

Share Result on Facebook