Pages that link to "Item:Q4651483"
From MaRDI portal
The following pages link to Incomplete Directed Perfect Phylogeny (Q4651483):
Displaying 12 items.
- \textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time (Q378228) (← links)
- Influence of tree topology restrictions on the complexity of haplotyping with missing data (Q428852) (← links)
- The binary perfect phylogeny with persistent characters (Q714807) (← links)
- Fast compatibility testing for rooted phylogenetic trees (Q724246) (← links)
- A colored graph approach to perfect phylogeny with persistent characters (Q728267) (← links)
- Incomplete directed perfect phylogeny in linear time (Q832858) (← links)
- Character-based phylogeny construction and its application to tumor evolution (Q2011627) (← links)
- Structured preferences: a literature survey (Q2096158) (← links)
- Tree compatibility, incomplete directed perfect phylogeny, and dynamic graph connectivity: an experimental study (Q2312406) (← links)
- A cubic-vertex kernel for flip consensus tree (Q2441594) (← links)
- THE COMPUTATIONAL COMPLEXITY OF AVOIDING FORBIDDEN SUBMATRICES BY ROW DELETIONS (Q3421857) (← links)
- Parameterized Complexity for Finding a Perfect Phylogeny from Mixed Tumor Samples (Q6077980) (← links)