Faster STR-EC-LCS Computation

Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

研究成果: 著書/レポートタイプへの貢献会議での発言

抜粋

The longest common subsequence (LCS) problem is a central problem in stringology that finds the longest common subsequence of given two strings A and B. More recently, a set of four constrained LCS problems (called generalized constrained LCS problem) were proposed by Chen and Chao [J. Comb. Optim, 2011]. In this paper, we consider the substring-excluding constrained LCS (STR-EC-LCS) problem. A string Z is said to be an STR-EC-LCS of two given strings A and B excluding P if, Z is one of the longest common subsequences of A and B that does not contain P as a substring. Wang et al. proposed a dynamic programming solution which computes an STR-EC-LCS in O(mnr) time and space where [Inf. Process. Lett., 2013]. In this paper, we show a new solution for the STR-EC-LCS problem. Our algorithm computes an STR-EC-LCS in time where denotes the set of distinct characters occurring in both A and B, and L is the length of the STR-EC-LCS. This algorithm is faster than the O(mnr)-time algorithm for short/long STR-EC-LCS (namely, or), and is at least as efficient as the O(mnr)-time algorithm for all cases.

元の言語英語
ホスト出版物のタイトルSOFSEM 2020
ホスト出版物のサブタイトルTheory and Practice of Computer Science - 46th International Conference on Current Trends in Theory and Practice of Informatics, SOFSEM 2020, Proceedings
編集者Alexander Chatzigeorgiou, Riccardo Dondi, Herodotos Herodotou, Christos Kapoutsis, Yannis Manolopoulos, George A. Papadopoulos, Florian Sikora
出版者Springer
ページ125-135
ページ数11
ISBN(印刷物)9783030389185
DOI
出版物ステータス出版済み - 1 1 2020
イベント46th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2020 - Limassol, キプロス
継続期間: 1 20 20201 24 2020

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
12011 LNCS
ISSN(印刷物)0302-9743
ISSN(電子版)1611-3349

会議

会議46th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2020
キプロス
Limassol
期間1/20/201/24/20

    フィンガープリント

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

これを引用

Yamada, K., Nakashima, Y., Inenaga, S., Bannai, H., & Takeda, M. (2020). Faster STR-EC-LCS Computation. : A. Chatzigeorgiou, R. Dondi, H. Herodotou, C. Kapoutsis, Y. Manolopoulos, G. A. Papadopoulos, & F. Sikora (版), SOFSEM 2020: Theory and Practice of Computer Science - 46th International Conference on Current Trends in Theory and Practice of Informatics, SOFSEM 2020, Proceedings (pp. 125-135). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 12011 LNCS). Springer. https://doi.org/10.1007/978-3-030-38919-2_11