Approximation algorithms for bounded degree phylogenetic roots

DOI10.1007/s00453-007-9072-zzbMath1139.68057OpenAlexW2157564181MaRDI QIDQ926287

Zhi-Zhong Chen

Publication date: 27 May 2008

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-007-9072-z

zbMATH Keywords

Computational biologyApproximation algorithmsRandomized algorithmsGraph algorithmsPhylogenetic rootsPhylogenies

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Unnamed Item
• Correlation clustering
• An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes
• Computing phylogenetic roots with bounded degrees and errors is NP-complete
• Cluster graph modification problems
• Clustering with qualitative information
• An empirical comparison of heuristic methods for creating maximally diverse groups
• On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs
• Computing Phylogenetic Roots with Bounded Degrees and Errors
• Computing bounded-degree phylogenetic roots of disconnected graphs

This page was built for publication: Approximation algorithms for bounded degree phylogenetic roots