On the parameterized complexity of the Multi-MCT and Multi-MCST problems
- 69 Downloads
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.
KeywordsMulti-MCT Multi-MCST W-hierarchy Parameterized complexity Computational complexity
Unable to display preview. Download preview PDF.
- Akutsu T (1992) An RNC algorithm for finding a largest common subtree of two trees. IEICE Trans Inf Syst 75(1):95–101 Google Scholar
- Aoki KF, Yamaguchi A, Okuno Y, Akutsu T, Ueda N, Kanehisa M, Mamitsuka H (2003) Efficient tree-matching methods for accurate carbohydrate database queries. Genome Inf 14:134–143 Google Scholar
- Bodlaender H, Downey R, Fellows M, Hallett M, Wareham H (1995b) Parameterized complexity analysis in computational biology. Comput Appl Biosci 11(1):49–57 Google Scholar
- Downey RG, Fellows MR (1999) Parameterized complexity. Springer, New York Google Scholar
- Farach M, Thorup M (1994) Fast comparison of evolutionary trees. In: The fifth annual ACM-SIAM symposium on discrete algorithms. Society for Industrial and Applied Mathematics, Arlington, pp 481–488 Google Scholar
- Hallett MT (1996) An integrated complexity analysis of problems from computational biology. PhD thesis, University of Victoria Google Scholar