Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees

We study parameterized algorithms and approximation algorithms for the maximum agreement forest problem, which, for two given leaf-labeled trees, is to find a maximum forest that is a subgraph of both trees. The problem was motivated by research in phylogenetics. For parameterized algorithms, while...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 562; pp. 496 - 512
Main Authors:	Chen, Jianer, Fan, Jia-Hao, Sze, Sing-Hoi
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 2015
Subjects:	Algorithms Approximation Approximation algorithm Fixed-parameter tractability Forests Mathematical analysis Maximum agreement forest Phylogenetic tree Trees Maximum agreement forest Approximation algorithm Fixed-parameter tractability Phylogenetic tree
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!