Parameterized complexity and approximability of the Longest Compatible Sequence problem
Author:
- S. GuillemotSGS. Guillemot
- 1 February 2011
- journal article
- Published by Elsevier in Discrete Optimization
- Vol. 8 (1) , 50-60
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A fixed-parameter algorithm for the directed feedback vertex set problem2008
- On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problemsJournal of Computer and System Sciences, 2003
- Analogs & duals of the MAST problem for sequences & treesJournal of Algorithms, 2003
- Efficient similarity search and classification via rank aggregation2003
- Rank aggregation methods for the Web2001
- The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphsTheoretical Computer Science, 2000
- Approximating Minimum Feedback Sets and Multicuts in Directed GraphsAlgorithmica, 1998
- On the parameterized complexity of short computation and factorizationArchive for Mathematical Logic, 1997
- Packing directed circuits fractionallyCombinatorica, 1995
- The Complexity of Some Problems on Subsequences and SupersequencesJournal of the ACM, 1978