Minimal Triangulation Algorithms for Perfect Phylogeny Problems

DOI10.1007/978-3-319-04921-2_34zbMath1407.68358arXiv1303.3931OpenAlexW959344381MaRDI QIDQ5404932

Rob Gysel

Publication date: 31 March 2014

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.3931

zbMATH Keywords

minimal triangulationperfect phylogeny

Mathematics Subject Classification ID

Problems related to evolution (92D15) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

Approximately counting locally-optimal structures ⋮ Approximately Counting Locally-Optimal Structures ⋮ Finding optimal triangulations parameterized by edge clique cover ⋮ Unnamed Item ⋮ Solving Graph Problems via Potential Maximal Cliques ⋮ Algorithms parameterized by vertex cover and modular width, through potential maximal cliques

This page was built for publication: Minimal Triangulation Algorithms for Perfect Phylogeny Problems