scientific article; zbMATH DE number 1615277

MaRDI QIDQ2723947zbMATH OpenFDO

Authors Itsik Pe'er, Ron Shamir, Roded Sharan

Publication date 8 July 2001

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Ecology (92D40)

Recommendations

• Incomplete Directed Perfect Phylogeny
• On the Generality of Phylogenies from Incomplete Directed Characters
• A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies
• Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees
• A linear-time algorithm for the perfect phylogeny haplotype problem

Cited in

(9)

• A linear-time algorithm for the perfect phylogeny haplotype problem
• On the Generality of Phylogenies from Incomplete Directed Characters
• A Polynomial-Time Algorithm For the Perfect Phylogeny Problem When the Number of Character States is Fixed
• A simple characterization of the minimal obstruction sets for three-state perfect phylogenies
• Incomplete Directed Perfect Phylogeny
• When and how the perfect phylogeny model explains evolution
• The binary perfect phylogeny with persistent characters
• Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
• Incomplete directed perfect phylogeny in linear time

This page was built for publication:

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