Pages that link to "Item:Q5404932"
From MaRDI portal
The following pages link to Minimal Triangulation Algorithms for Perfect Phylogeny Problems (Q5404932):
Displaying 13 items.
- Approximately counting locally-optimal structures (Q295655) (← links)
- Graph triangulations and the compatibility of unrooted phylogenetic trees (Q628277) (← links)
- Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087) (← links)
- Finding optimal triangulations parameterized by edge clique cover (Q2161006) (← links)
- Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks (Q2266938) (← links)
- Maximal sub-triangulation in pre-processing phylogenetic data (Q2500753) (← links)
- Approximately Counting Locally-Optimal Structures (Q3448823) (← links)
- Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction (Q3638844) (← links)
- (Q4410150) (← links)
- (Q4608616) (← links)
- Solving Graph Problems via Potential Maximal Cliques (Q4629543) (← links)
- Research in Computational Molecular Biology (Q5706908) (← links)
- (Q6089669) (← links)