Incomplete Directed Perfect Phylogeny

DOI10.1137/S0097539702406510zbMath1056.05136OpenAlexW2157751858WikidataQ56879929 ScholiaQ56879929MaRDI QIDQ4651483

Roded Sharan, T. Pupko, Ron Shamir, Itsik Pe'er

Publication date: 21 February 2005

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539702406510

zbMATH Keywords

incomplete dataevolutionperfect phylogenygraph sandwich

Mathematics Subject Classification ID

Problems related to evolution (92D15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (12)

Incomplete directed perfect phylogeny in linear time ⋮ \textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time ⋮ Parameterized Complexity for Finding a Perfect Phylogeny from Mixed Tumor Samples ⋮ Influence of tree topology restrictions on the complexity of haplotyping with missing data ⋮ A cubic-vertex kernel for flip consensus tree ⋮ Character-based phylogeny construction and its application to tumor evolution ⋮ The binary perfect phylogeny with persistent characters ⋮ Fast compatibility testing for rooted phylogenetic trees ⋮ A colored graph approach to perfect phylogeny with persistent characters ⋮ Tree compatibility, incomplete directed perfect phylogeny, and dynamic graph connectivity: an experimental study ⋮ THE COMPUTATIONAL COMPLEXITY OF AVOIDING FORBIDDEN SUBMATRICES BY ROW DELETIONS ⋮ Structured preferences: a literature survey

This page was built for publication: Incomplete Directed Perfect Phylogeny