On the approximation of computing evolutionary trees

Authors:
Vincent Berry;Sylvain Guillemot;François Nicolas;Christophe Paul
Affiliations:
Département Informatique, L.I.R.M.M. C.N.R.S., Montpellier Cedex 5;Département Informatique, L.I.R.M.M. C.N.R.S., Montpellier Cedex 5;Département Informatique, L.I.R.M.M. C.N.R.S., Montpellier Cedex 5;Département Informatique, L.I.R.M.M. C.N.R.S., Montpellier Cedex 5
Venue:
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Year:
2005

Citing 13
Cited 8

Kaikoura tree theorems: computing the maximum agreement subtree

Information Processing Letters
On the Approximation of Shortest Common Supersequencesand Longest Common Subsequences

SIAM Journal on Computing
On the agreement of many trees

Information Processing Letters
On the complexity of comparing evolutionary trees

Discrete Applied Mathematics - Special volume on computational molecular biology
Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms

SIAM Journal on Computing
Some APX-completeness results for cubic graphs

Theoretical Computer Science
An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings

Journal of Algorithms
An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees

SIAM Journal on Computing
Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time

WABI '01 Proceedings of the First International Workshop on Algorithms in Bioinformatics
Approximating the Complement of the Maximum Compatible Subset of Leaves of k Trees

APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
A Decomposition Theorem for Maximum Weight Bipartite Matchings with Applications to Evolutionary Trees

ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Towards optimal lower bounds for clique and chromatic number

Theoretical Computer Science
Improved Parameterized Complexity of the Maximum Agreement Subtree and Maximum Compatible Tree Problems

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)

Improved Parameterized Complexity of the Maximum Agreement Subtree and Maximum Compatible Tree Problems

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Maximum agreement and compatible supertrees

Journal of Discrete Algorithms
Approximating the spanning star forest problem and its applications to genomic sequence alignment

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Approximation Algorithms for the Spanning Star Forest Problem

APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems

Discrete Applied Mathematics
An improved approximation algorithm for spanning star forest in dense graphs

COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
On variants of the spanning star forest problem

FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Improved approximation for spanning star forest in dense graphs

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a set of leaf-labelled trees with identical leaf sets, the well-known MAST problem consists of finding a subtree homeomorphically included in all input trees and with the largest number of leaves. MAST and its variant called MCT are of particular interest in computational biology. This paper presents positive and negative results on the approximation of MAST, MCT and their complement versions, denoted CMAST and CMCT. For CMAST and CMCT on rooted trees we give 3-approximation algorithms achieving significantly lower running times than those previously known. In particular, the algorithm for CMAST runs in linear time. The approximation threshold for CMAST, resp. CMCT, is shown to be the same whenever collections of rooted trees or of unrooted trees are considered. Moreover, hardness of approximation results are stated for CMAST, CMCT and MCT on small number of trees, and for MCT on unbounded number of trees.