A 3-approximation algorithm for the subtree distance between phylogenies
type: Item
instance of: scholarly article
title: A 3-approximation algorithm for the subtree distance between phylogenies
zbMATH Open document ID: 1171.05317
author: Magnus Bordewich
author: Catherine McCartin
author: Charles Semple
published in: Journal of Discrete Algorithms
publication date: 2009-05-13T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 92D15
zbMATH DE Number: 5553599
zbMATH Keywords: rooted subtree prune and regraft
zbMATH Keywords: agreement forest
MaRDI profile type: Publication
full work available at URL: j.jda.2007.10.002
OpenAlex ID: W2042877799
cites work: On the computational complexity of the rooted subtree prune and regraft distance
cites work: Computing the minimum number of hybridization events for a consistent evolutionary history
cites work: Q4393480
cites work: A faster FPT algorithm for the maximum agreement forest problem
cites work: Reconstructing evolution of sequences subject to recombination using parsimony
cites work: On the complexity of comparing evolutionary trees
cites work: Q4780791
cites work: Q4792088
DOI: 10.1016/J.JDA.2007.10.002
description: scientific article; zbMATH DE number 5553599