On the Generality of Phylogenies from Incomplete Directed Characters

DOI10.1007/3-540-45471-3_37MaRDI QIDQ3046511zbMATH OpenOpenAlexFDO

Authors Itsik Pe'er, Ron Shamir, Roded Sharan

Publication date 12 August 2004

Published in Algorithm Theory — SWAT 2002 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45471-3_37

zbMATH Keywords

computational biologyphylogeny of a set of species

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Genetics and epigenetics (92D10) Problems related to evolution (92D15)

Recommendations

• Incomplete Directed Perfect Phylogeny
• scientific article; zbMATH DE number 1615277
• A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies
• Tree compatibility, incomplete directed perfect phylogeny, and dynamic graph connectivity: an experimental study
• Two strikes against perfect phylogeny

Cited in

(4)

• scientific article; zbMATH DE number 1615277 (Why is no real title available?)
• Incomplete Directed Perfect Phylogeny
• Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
• Incomplete directed perfect phylogeny in linear time

This page was built for publication: On the Generality of Phylogenies from Incomplete Directed Characters

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