Results 1  10
of
2,815
Rooted Maximum Agreement Supertrees
, 2005
"... Given a set T of rooted, unordered trees, where each Ti ∈ T is distinctly leaflabeled by a set �(Ti) and where the sets �(Ti) may overlap, the maximum agreement supertree problem (MASP) is to construct a distinctly leaflabeled tree Q with leaf set �(Q) ⊆ ∪Ti ∈T �(Ti) such that �(Q)  is maximiz ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
Given a set T of rooted, unordered trees, where each Ti ∈ T is distinctly leaflabeled by a set �(Ti) and where the sets �(Ti) may overlap, the maximum agreement supertree problem (MASP) is to construct a distinctly leaflabeled tree Q with leaf set �(Q) ⊆ ∪Ti ∈T �(Ti) such that �(Q
The Kernel of Maximum Agreement Subtrees
"... Abstract. A Maximum Agreement SubTree (MAST) is a largest subtree common to a set of trees and serves as a summary of common substructure in the trees. A single MAST can be misleading, however, since there can be an exponential number of MASTs, and two MASTs for the same tree set do not even neces ..."
Abstract
 Add to MetaCart
Abstract. A Maximum Agreement SubTree (MAST) is a largest subtree common to a set of trees and serves as a summary of common substructure in the trees. A single MAST can be misleading, however, since there can be an exponential number of MASTs, and two MASTs for the same tree set do not even
Maximum agreement and compatible supertrees
 Proceedings of the 15th Combinatorial Pattern Matching Symposium (CPM’O4), volume 3109 of LNCS
, 2004
"... Given a set of leaflabelled trees with identical leaf sets, the MAST problem, respectively MCT problem, consists of finding a largest subset of leaves such that all input trees restricted to these leaves are isomorphic, respectively compatible. In this paper, we propose extensions of these problem ..."
Abstract

Cited by 20 (8 self)
 Add to MetaCart
to obtain the agreement of the input trees. A simlar result holds for SMCT. Moreover, the corresponding optimization problems, that is the complements of SMAST and SMCT, can not be approximated in polynomial time within a constant factor, unless P = NP. These results also hold when the input trees have a
Improved Parameterized Complexity of the Maximum Agreement Subtree and . . .
 IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS
, 2006
"... Given a set of evolutionary trees on a same set of taxa, the maximum agreement subtree problem (MAST), respectively maximum compatible tree problem (MCT), consists of finding a largest subset of taxa such that all input trees restricted to these taxa are isomorphic, respectively compatible. These ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
Given a set of evolutionary trees on a same set of taxa, the maximum agreement subtree problem (MAST), respectively maximum compatible tree problem (MCT), consists of finding a largest subset of taxa such that all input trees restricted to these taxa are isomorphic, respectively compatible
An improved bound on the maximum agreement subtree problem
 Appl Math Lett
"... We improve the lower bound on the extremal version of the Maximum Agreement Subtree problem. Namely we prove that two binary trees on the same n leaves have subtrees with the same ≥ c log log n leaves which are homeomorphic, such that homeomorphism is identity on the leaves. ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We improve the lower bound on the extremal version of the Maximum Agreement Subtree problem. Namely we prove that two binary trees on the same n leaves have subtrees with the same ≥ c log log n leaves which are homeomorphic, such that homeomorphism is identity on the leaves.
Fixedparameter and approximation algorithms for maximum agreement forests
, 2011
"... We present new and improved approximation and FPT algorithms for computing rooted and unrooted maximum agreement forests (MAFs) of a pair of phylogenetic trees. Their sizes correspond to the subtreepruneandregraft distance and the treebisectionandreconnection distances, respectively. We also p ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
We present new and improved approximation and FPT algorithms for computing rooted and unrooted maximum agreement forests (MAFs) of a pair of phylogenetic trees. Their sizes correspond to the subtreepruneandregraft distance and the treebisectionandreconnection distances, respectively. We also
Fixedparameter algorithms for maximum agreement forests
 SIAM Journal on Computing
"... Abstract. We present new and improved fixedparameter algorithms for computing maximum agreement forests (MAFs) of pairs of rooted binary phylogenetic trees. The size of such a forest for two trees corresponds to their subtree pruneandregraft distance and, if the agreement forest is acyclic, to th ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
Abstract. We present new and improved fixedparameter algorithms for computing maximum agreement forests (MAFs) of pairs of rooted binary phylogenetic trees. The size of such a forest for two trees corresponds to their subtree pruneandregraft distance and, if the agreement forest is acyclic
Calculation, visualization and manipulation of MASTs (maximum agreement subtrees)
 IN PROCEEDINGS OF THE IEEE COMPUTATIONAL SYSTEMS BIOINFORMATICS CONFERENCE
, 2004
"... Phylogenetic trees are used to represent the evolutionary history of a set of species. Comparison of multiple phylogenetic trees can help researchers find the common classification of a tree group, compare tree construction inferences or obtain distances between trees. We present TreeAnalyzer, a fre ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
freely available package for phylogenetic tree comparison. A MAST (Maximum Agreement Subtree) algorithm is implemented to compare the trees. Additional features of this software include tree comparison, visualization, manipulation, labeling, and printing.
The Maximum Agreement Subtree Problem for Binary Trees
, 1995
"... We consider the problem of computing the Maximum Agreement Subtree (a maximum common topological restriction) of two binary labeled trees. We show that the problem can be solved in O(n log 3 n) using a novel dynamic programming approach. This improves on the previous O(nc p log n )time algorit ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
We consider the problem of computing the Maximum Agreement Subtree (a maximum common topological restriction) of two binary labeled trees. We show that the problem can be solved in O(n log 3 n) using a novel dynamic programming approach. This improves on the previous O(nc p log n )time
Results 1  10
of
2,815