Document Open Access Logo

An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions

Authors Laurent Bulteau , Mark Jones , Rolf Niedermeier , Till Tantau

PDF
Thumbnail PDF

File

LIPIcs.CPM.2022.6.pdf
  • Filesize: 0.76 MB
  • 11 pages

Document Identifiers

Author Details

Laurent Bulteau
  • LIGM, CNRS, Université Gustave Eiffel, F77454 Marne-la-vallée, France
Mark Jones
  • Delft Institute of Applied Mathematics, Delft University of Technology, The Netherlands
Rolf Niedermeier
  • Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Germany
Till Tantau
  • Institute of Theoretical Computer Science, University of Lübeck, Germany

Funding

  • Jones, Mark: Supported by Netherlands Organization for Scientific Research (NWO) through grants NETWORKS and OCENW.KLEIN.125.
  • Niedermeier, Rolf: Supported by the DFG, NI 369/16, FPTinP.

Acknowledgements

This work was initiated during Dagstuhl Seminar 19443, Algorithms and Complexity in Phylogenetics, held at Schloss Dagstuhl, Germany, in October 2019 [Magnus Bordewich et al., 2019].

Cite As Get BibTex

Laurent Bulteau, Mark Jones, Rolf Niedermeier, and Till Tantau. An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions. In 33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 223, pp. 6:1-6:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022) https://doi.org/10.4230/LIPIcs.CPM.2022.6

Abstract

In the NP-hard Longest Common Subsequence problem (LCS), given a set of strings, the task is to find a string that can be obtained from every input string using as few deletions as possible. LCS is one of the most fundamental string problems with numerous applications in various areas, having gained a lot of attention in the algorithms and complexity research community. Significantly improving on an algorithm by Irving and Fraser [CPM'92], featured as a research challenge in a 2014 survey paper, we show that LCS is fixed-parameter tractable (FPT) when parameterized by the maximum number of deletions per input string. Given the relatively moderate running time of our algorithm (linear time when the parameter is a constant) and small parameter values to be expected in several applications, we believe that our purely theoretical analysis could finally pave the way to a new, exact and practically useful algorithm for this notoriously hard string problem.

Subject Classification

ACM Subject Classification
  • Theory of computation → Design and analysis of algorithms
  • Theory of computation → Theory and algorithms for application domains
Keywords
  • NP-hard string problems
  • multiple sequence alignment
  • center string
  • parameterized complexity
  • search tree algorithms
  • enumerative algorithms

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Amir Abboud, Arturs Backurs, and Virginia Vassilevska Williams. Tight hardness results for LCS and other sequence similarity measures. In IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, pages 59-78. IEEE Computer Society, 2015. Google Scholar
  2. Lasse Bergroth, Harri Hakonen, and Timo Raita. A survey of longest common subsequence algorithms. In Seventh International Symposium on String Processing and Information Retrieval, SPIRE 2000, pages 39-48. IEEE Computer Society, 2000. Google Scholar
  3. Magnus Bordewich, Britta Dorn, Simone Linz, and Rolf Niedermeier. Algorithms and complexity in phylogenetics (dagstuhl seminar 19443). Dagstuhl Reports, 9(10):134-151, 2019. Google Scholar
  4. Mahdi Boroujeni, Masoud Seddighin, and Saeed Seddighin. Improved algorithms for edit distance and LCS: beyond worst case. In Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, pages 1601-1620. SIAM, 2020. Google Scholar
  5. Christina Boucher and Bin Ma. Closest string with outliers. BMC Bioinformatics, 12(1):1-7, 2011. Google Scholar
  6. Karl Bringmann and Marvin Künnemann. Multivariate fine-grained complexity of longest common subsequence. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, pages 1216-1235. SIAM, 2018. Google Scholar
  7. Laurent Bulteau, Falk Hüffner, Christian Komusiewicz, and Rolf Niedermeier. Multivariate algorithmics for NP-hard string problems. Bulletin of the EATCS, 114, 2014. Google Scholar
  8. Laurent Bulteau and Mathias Weller. Parameterized algorithms in bioinformatics: An overview. Algorithms, 12(12):256, 2019. Google Scholar
  9. Alessio Conte, Roberto Grossi, Giulia Punzi, and Takeaki Uno. Polynomial-delay enumeration of maximal common subsequences. In 26th International Symposium on String Processing and Information Retrieval, SPIRE 2019, pages 189-202. Springer, 2019. Google Scholar
  10. Rodney G. Downey and Michael R. Fellows. Parameterized Complexity. Springer, 1999. Google Scholar
  11. MohammadTaghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, and Xiaorui Sun. Approximating LCS in linear time: Beating the √n barrier. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, pages 1181-1200. SIAM, 2019. Google Scholar
  12. Gary Hoppenworth, Jason W. Bentley, Daniel Gibney, and Sharma V. Thankachan. The fine-grained complexity of median and center string problems under edit distance. In 28th Annual European Symposium on Algorithms, ESA 2020, volume 173 of LIPIcs, pages 61:1-61:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. Google Scholar
  13. Robert W. Irving and Campbell Fraser. Two algorithms for the longest common subsequence of three (or more) strings. In Third Annual Symposium on Combinatorial Pattern Matching, CPM 1992, volume 644 of Lecture Notes in Computer Science, pages 214-229. Springer, 1992. Google Scholar
  14. Narao Nakatsu, Yahiko Kambayashi, and Shuzo Yajima. A longest common subsequence algorithm suitable for similar text strings. Acta Informatica, 18:171-179, 1982. Google Scholar
  15. François Nicolas and Eric Rivals. Hardness results for the center and median string problems under the weighted and unweighted edit distances. Journal of Discrete Algorithms, 3(2):390-415, 2005. Google Scholar
  16. Krzysztof Pietrzak. 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. Google Scholar
  17. Yoshifumi Sakai. Maximal Common Subsequence Algorithms. In 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018), volume 105 of Leibniz International Proceedings in Informatics (LIPIcs), pages 1:1-1:10. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2018. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact