Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees
type: Item
instance of: scholarly article
title: Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees
zbMATH Open document ID: 1303.68154
author: Jia-Hao Fan
author: Sing-Hoi Sze
author: Jianer Chen
published in: Theoretical Computer Science
publication date: 2014-12-02T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 92D15
zbMATH DE Number: 6375997
zbMATH Keywords: approximation algorithm
zbMATH Keywords: fixed-parameter tractability
zbMATH Keywords: phylogenetic tree
zbMATH Keywords: maximum agreement forest
describes a project that uses: rSPR
MaRDI profile type: Publication
full work available at URL: j.tcs.2014.10.031
OpenAlex ID: W2052824789
cites work: Subtree transfer operations and their induced metrics on evolutionary trees
cites work: Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms
cites work: A 3-approximation algorithm for the subtree distance between phylogenies
cites work: On the computational complexity of the rooted subtree prune and regraft distance
cites work: Approximating the maximum agreement forest on \(k\) trees
cites work: On the linear-cost subtree-transfer distance between phylogenetic trees
cites work: Q4393480
cites work: Q3128909
cites work: A faster FPT algorithm for the maximum agreement forest problem
cites work: On the complexity of comparing evolutionary trees
cites work: Q4780791
cites work: The maximum agreement forest problem: Approximation algorithms and computational experiments
cites work: Fixed-parameter algorithms for maximum agreement forests
DOI: 10.1016/J.TCS.2014.10.031
description: scientific article; zbMATH DE number 6375997