Reconstructing the shape of a tree from observed dissimilarity data
Advances in Applied Mathematics
Kaikoura tree theorems: computing the maximum agreement subtree
Information Processing Letters
A fixed-parameter algorithm for minimum quartet inconsistency
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Mining Closed and Maximal Frequent Subtrees from Databases of Labeled Rooted Trees
IEEE Transactions on Knowledge and Data Engineering
Rooted Maximum Agreement Supertrees
Algorithmica
Encyclopedia of Algorithms
Maximum agreement and compatible supertrees
Journal of Discrete Algorithms
New results on optimizing rooted triplets consistency
Discrete Applied Mathematics
Computing a Smallest Multilabeled Phylogenetic Tree from Rooted Triplets
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Kernel and fast algorithm for dense triplet inconsistency
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
| Hi-index | 0.00 |
Given a ground set L of labels and a collection of trees whose leaves are bijectively labelled by some elements of L, the Maximum Agreement Supertree problem (SMAST) is the following: find a tree T on a largest label set L′ ⊆ L that homeomorphically contains every input tree restricted to L′. The problem finds applications in several fields, e.g. phylogenetics. In this paper we focus on the parameterized complexity of this NP-hard problem. We consider different combinations of parameters for SMAST as well as particular cases, providing both FPT algorithms and intractability results.