A polynomial-time algorithm for near-perfect phylogeny
From MaRDI portal
Recommendations
- A Polynomial-Time Algorithm for Near-Perfect Phylogeny
- Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction
- A Polynomial-Time Algorithm For the Perfect Phylogeny Problem When the Number of Character States is Fixed
- scientific article; zbMATH DE number 910918
- Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees
Cited in
(14)- Approximation algorithms for the fixed-topology phylogenetic number problem
- On the approximability of the Steiner tree problem in phylogeny
- Approximation algorithms for tree alignment with a given phylogeny
- A signal-to-noise analysis of phylogeny estimation by neighbor-joining: Insufficiency of polynomial length sequences
- Additive approximation for near-perfect phylogeny construction
- Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees
- Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction
- A Polynomial-Time Algorithm for Near-Perfect Phylogeny
- Optimal Completion of Incomplete Gene Trees in Polynomial Time Using OCTAL
- Minimal Triangulation Algorithms for Perfect Phylogeny Problems
- A linear-time algorithm for the perfect phylogeny haplotyping (PPH) problem
- Parameterized algorithms for the Steiner arborescence problem on a hypercube
- Incomplete directed perfect phylogeny in linear time
- A subdivision approach to maximum parsimony
This page was built for publication: A polynomial-time algorithm for near-perfect phylogeny
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4818875)