Parameterized complexity and approximability of the SLCS problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5018 LNCS, Issue , 2008, Pages 115-128

  Guillemot, Sylvain ^a  

^a ECOLE CENTRALE DE LILLE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; HIERARCHICAL SYSTEMS; PARAMETER ESTIMATION;

LONGEST COMPATIBLE SEQUENCE (SLCS); P-SEQUENCES; W-HIERARCHY;

PROBLEM SOLVING;

EID: 44649196651     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79723-4_12     Document Type: Conference Paper

References (22)

1. Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hallett, M.T., Wareham, H.T.: Parameterized complexity analysis in computational biology. Computer Applications in the Biosciences 11(1), 49-57 (1995)
2. Bodlaender, H.L., Downey, R.G., Fellows, M.R., Wareham, H.T.: The parameterized complexity of sequence alignment and consensus. Theoretical Computer Science 147(1-2), 31-54 (1994)
3. Bodlaender, H.L., Fellows, M.R., Hallett, M.T.: Beyond NP-completeness for problems of bounded width: Hardness for the W hierarchy (extended abstract). In: Proc. STOC 1994, pp. 449-458. ACM, New York (1994)
4. Bodlaender, H.L., Fellows, M.R., Hallett, M.T.: The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs. Theoretical Computer Science 244(1), 167-188 (2000)
5. Cai, L., Chen, J., Downey, R.G., Fellows, M.R.: On the parameterized complexity of short computation and factorization. Archive for Mathematical Logic 36(4-5), 321-337 (1997)
6. Chen, J., Liu, Y., Lu, S., O'Sullivan, B., Razgon, I.: A Fixed-Parameter Algorithm for the Directed Feedback Vertex Set Problem. In: Proc. STOC 2008 (to appear, 2008)
7. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
8. Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank Aggregation Methods for the Web. In: WWW10 (2001)
9. Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation revisited (2001)
10. Even, G., Naor, J., Schieber, B., Sudan, M.: Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica 20, 151-174 (1998)
11. Fagin, R., Kumar, R., Sivakumar, D.: Efficient similarity search and classification via rank aggregation. In: Proc. ACM SIGMOD 2003, pp. 301-312 (2003)
12. Fellows, M.R., Hallett, M.T., Stege, U.: Analogs & duals of the MAST problem for sequences & trees. Journal of Algorithms 49(1), 192-216 (2003)
13. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
14. Halldórsson, M.M.: Approximation via Partitioning. Technical Report IS-RR-95-0003F, School of Information Science, Japan Advanced Institute of Science and Technology, Hokuriku (1995)
15. Hallett, M.T.: An integrated complexity analysis of problems from computational biology. PhD thesis, Department of Computer Science, University of Victoria, Victoria, B.C., Canada (1996)
16. Hodge, J., Klima, R.E.: The Mathematics of Voting and Elections: A Hands-On Approach. In: Mathematical World, vol. 22. AMS (2000)
17. Maier, D.: The complexity of some problems on subsequences and supersequences. J. ACM 25(2), 322-336 (1978)
18. Moret, B.M.E., Tang, J., Warnow, T.: Reconstructing phylogenies from genecontent and gene-order data. In: Gascuel, O. (ed.) Mathematics of phylogeny and evolution. Oxford University Press, Oxford (2004)
19. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)
20. Pietrzak, K.: On the Parameterized Complexity of the fixed alphabet Shortest Common Supersequence and Longest Common Subsequence Problems. Journal of Computer and System Sciences 67(4), 757-771 (2003)
21. Seymour, P.D.: Packing directed circuits fractionally. Combinatorica 15, 281-288 (1995)
22. Wareham, H.T.: The parameterized complexity of intersection and composition operations on sets of finite-state automata. In: Yu, S., Pǎun, A. (eds.) CIAA 2000. LNCS, vol. 2088, pp. 302-310. Springer, Heidelberg (2001)