Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction

DOI10.1007/11786986_58MaRDI QIDQ3613799zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Guy E. Blelloch, Kedar Dhamdhere, Eran Halperin, R. Ravi, Russell Schwartz, Srinath Sridhar

Publication date 12 March 2009

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11786986_58

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Problems related to evolution (92D15)

Recommendations

• A Polynomial-Time Algorithm for Near-Perfect Phylogeny
• scientific article; zbMATH DE number 2102787
• Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees
• Additive approximation for near-perfect phylogeny construction
• scientific article; zbMATH DE number 2089965

Cited in

(11)

• Computing optimal Steiner trees in polynomial space
• Additive approximation for near-perfect phylogeny construction
• Parameterized single-exponential time polynomial space algorithm for Steiner tree
• Faster Steiner Tree Computation in Polynomial-Space
• Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees
• A Polynomial-Time Algorithm for Near-Perfect Phylogeny
• Covering Vectors by Spaces: Regular Matroids
• Parameterized single-exponential time polynomial space algorithm for Steiner tree
• scientific article; zbMATH DE number 2102787 (Why is no real title available?)
• Definition and algorithms for reliable Steiner tree problem
• Parameterized algorithms for the Steiner arborescence problem on a hypercube

This page was built for publication: Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3613799)