Skip to main content
SpringerLink
Log in

Parameterized Complexity and Approximability of the SLCS Problem

  • Conference paper
Parameterized and Exact Computation (IWPEC 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5018))

Included in the following conference series:

Abstract

We introduce the Longest Compatible Sequence (Slcs) problem. This problem deals with p-sequences, which are strings on a given alphabet where each letter occurs at most once. The Slcs problem takes as input a collection of k p-sequences on a common alphabet L of size n, and seeks a p-sequence on L which respects the precedence constraints induced by each input sequence, and is of maximal length with this property. We investigate the parameterized complexity and the approximability of the problem. As a by-product of our hardness results for Slcs, we derive new hardness results for the Longest Common Subsequence problem and other problems hard for the W-hierarchy.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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)

    Google Scholar 

  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)

    MathSciNet  Google Scholar 

  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)

    Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Google Scholar 

  7. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)

    Google Scholar 

  8. Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank Aggregation Methods for the Web. In: WWW10 (2001)

    Google Scholar 

  9. Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation revisited (2001)

    Google Scholar 

  10. Even, G., Naor, J., Schieber, B., Sudan, M.: Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica 20, 151–174 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  11. Fagin, R., Kumar, R., Sivakumar, D.: Efficient similarity search and classification via rank aggregation. In: Proc. ACM SIGMOD 2003, pp. 301–312 (2003)

    Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  13. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)

    Google Scholar 

  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)

    Google Scholar 

  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)

    Google Scholar 

  16. Hodge, J., Klima, R.E.: The Mathematics of Voting and Elections: A Hands-On Approach. In: Mathematical World, vol. 22. AMS (2000)

    Google Scholar 

  17. Maier, D.: The complexity of some problems on subsequences and supersequences. J. ACM 25(2), 322–336 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  18. Moret, B.M.E., Tang, J., Warnow, T.: Reconstructing phylogenies from gene-content and gene-order data. In: Gascuel, O. (ed.) Mathematics of phylogeny and evolution. Oxford University Press, Oxford (2004)

    Google Scholar 

  19. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)

    MATH  Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  21. Seymour, P.D.: Packing directed circuits fractionally. Combinatorica 15, 281–288 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIFL/CNRS/INRIA, Bât. M3 Cité Scientifique, 59655, Villeneuve d’Ascq cedex, France

    Sylvain Guillemot

Authors
  1. Sylvain Guillemot
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Martin Grohe Rolf Niedermeier

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guillemot, S. (2008). Parameterized Complexity and Approximability of the SLCS Problem. In: Grohe, M., Niedermeier, R. (eds) Parameterized and Exact Computation. IWPEC 2008. Lecture Notes in Computer Science, vol 5018. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79723-4_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-79723-4_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-79722-7

  • Online ISBN: 978-3-540-79723-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation