On the parameterized complexity of the Multi-MCT and Multi-MCST problems

Authors:
Wenbin Chen;Matthew C. Schmidt;Nagiza F. Samatova
Affiliations:
Computer Science Department, North Carolina State University, Raleigh, USA 27695 and Computer Science and Mathematics Division, Oak Ridge National Laboratory, Oak Ridge, USA 37831;Computer Science Department, North Carolina State University, Raleigh, USA 27695 and Computer Science and Mathematics Division, Oak Ridge National Laboratory, Oak Ridge, USA 37831;Computer Science Department, North Carolina State University, Raleigh, USA 27695 and Computer Science and Mathematics Division, Oak Ridge National Laboratory, Oak Ridge, USA 37831
Venue:
Journal of Combinatorial Optimization
Year:
2011

Citing 8
Cited 0

The parameterized complexity of sequence alignment and consensus

Theoretical Computer Science
An integrated complexity analysis of problems from computational biology

An integrated complexity analysis of problems from computational biology
Fast comparison of evolutionary trees

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
On the approximation of largest common subtrees and largest common point sets

Theoretical Computer Science
Efficiently mining frequent trees in a forest

Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
An algebraic view of the relation between largest common subtrees and smallest common supertrees

Theoretical Computer Science
Efficiently Querying Large XML Data Repositories: A Survey

IEEE Transactions on Knowledge and Data Engineering
Parameterized Complexity

Parameterized Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

The comparison of tree structured data is widespread since trees can be used to represent wide varieties of data, such as XML data, evolutionary histories, or carbohydrate structures. Two graph-theoretical problems used in the comparison of such data are the problems of finding the maximum common subtree (MCT) and the minimum common supertree (MCST) of two trees. These problems generalize to the problem of finding the MCT and MCST of multiple trees (Multi-MCT and Multi-MCST, respectively). In this paper, we prove parameterized complexity hardness results for the different parameterized versions of the Multi-MCT and Multi-MCST problem under isomorphic embeddings.