Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees

DOI10.1007/11758525_107zbMATH Open1155.92342DBLPconf/iccS/SridharDBHRS06OpenAlexW1509880503WikidataQ60029823 ScholiaQ60029823MaRDI QIDQ3545135FDOQ3545135

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

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

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

Mathematics Subject Classification ID

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

Cited In (6)

• A Polynomial-Time Algorithm for Near-Perfect Phylogeny
• Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms
• Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction
• Incomplete Directed Perfect Phylogeny
• Title not available (Why is that?)
• Title not available (Why is that?)

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)