Computing bounded-degree phylogenetic roots of disconnected graphs

DOI10.1016/j.jalgor.2004.12.004zbMath1103.68089OpenAlexW2091622619MaRDI QIDQ5478010

Tatsuie Tsukiji, Zhi-Zhong Chen

Publication date: 30 June 2006

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jalgor.2004.12.004

zbMATH Keywords

graph algorithmphylogenycomputational biologygraph powerphylogenetic roottree power

Mathematics Subject Classification ID

Problems related to evolution (92D15) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

The 3-Steiner Root Problem ⋮ Approximation algorithms for bounded degree phylogenetic roots ⋮ Closest 4-leaf power is fixed-parameter tractable

This page was built for publication: Computing bounded-degree phylogenetic roots of disconnected graphs