Incomplete Directed Perfect Phylogeny
From MaRDI portal
Publication:4651483
DOI10.1137/S0097539702406510zbMath1056.05136WikidataQ56879929 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
92D15: Problems related to evolution
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Parameterized Complexity for Finding a Perfect Phylogeny from Mixed Tumor Samples, \textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time, Influence of tree topology restrictions on the complexity of haplotyping with missing data, The binary perfect phylogeny with persistent characters, Fast compatibility testing for rooted phylogenetic trees, A colored graph approach to perfect phylogeny with persistent characters, Incomplete directed perfect phylogeny in linear time, Character-based phylogeny construction and its application to tumor evolution, Structured preferences: a literature survey, Tree compatibility, incomplete directed perfect phylogeny, and dynamic graph connectivity: an experimental study, A cubic-vertex kernel for flip consensus tree, THE COMPUTATIONAL COMPLEXITY OF AVOIDING FORBIDDEN SUBMATRICES BY ROW DELETIONS