Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees

DOI10.1007/11758525_107MaRDI QIDQ3545135zbMATH OpenOpenAlexDBLPWikidataFDO

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

Publication date 9 December 2008

Published in Computational Science – ICCS 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11758525_107

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Computational methods for problems pertaining to biology (92-08) Problems related to evolution (92D15)

Recommendations

• A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies
• The binary perfect phylogeny with persistent characters
• Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction
• Additive approximation for near-perfect phylogeny construction
• scientific article; zbMATH DE number 2102787

Cited in

(11)

• The optimal rate for resolving a near-polytomy in a phylogeny
• scientific article; zbMATH DE number 1615277 (Why is no real title available?)
• Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges
• Additive approximation for near-perfect phylogeny construction
• Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms
• Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction
• A Polynomial-Time Algorithm for Near-Perfect Phylogeny
• Incomplete Directed Perfect Phylogeny
• scientific article; zbMATH DE number 2102787 (Why is no real title available?)
• On the Repeat-Annotated Phylogenetic Tree Reconstruction Problem
• The binary perfect phylogeny with persistent characters

This page was built for publication: Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees

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