Approximating the Maximum Agreement Forest on k trees

Authors:
Frédéric Chataigner
Affiliations:
LIAFA, université Denis Diderot, 2 place Jussieu, Paris cedex 05 75251, France
Venue:
Information Processing Letters
Year:
2005

Citing 2
Cited 2

On the complexity of comparing evolutionary trees

Discrete Applied Mathematics - Special volume on computational molecular biology
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications

SIAM Journal on Computing

The maximum agreement forest problem: Approximation algorithms and computational experiments

Theoretical Computer Science
A unifying view on approximation and FPT of agreement forests

WABI'09 Proceedings of the 9th international conference on Algorithms in bioinformatics

Quantified Score

Hi-index	0.89

Visualization

Abstract

The Maximum Agreement Forest problem (MAF) asks for the largest common subforest of a set of binary trees. This problem is known to be MAXSNP-complete for instances consisting of 2 trees. We show that it remains MAXSNP-complete for k=2 trees.