Longest common subsequence in at least k length order-isomorphic substrings

Yohei Ueki, Diptarama, Masatoshi Kurihara, Yoshiaki Matsuoka, Kazuyuki Narisawa, Ryo Yoshinaka, Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara

研究成果: Conference contribution

5 被引用数 (Scopus)

抄録

We consider the longest common subsequence (LCS) problem with the restriction that the common subsequence is required to consist of at least k length substrings. First, we show an O(mn) time algorithm for the problem which gives a better worst-case running time than existing algorithms, where m and n are lengths of the input strings. Furthermore, we mainly consider the LCS in at least k length order-isomorphic substrings problem. We show that the problem can also be solved in O(mn) worst-case time by an easy-to-implement algorithm.

本文言語English
ホスト出版物のタイトルSOFSEM 2017
ホスト出版物のサブタイトルTheory and Practice of Computer Science - 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings
編集者Christel Baier, Mark van den Brand, Johann Eder, Mike Hinchey, Tiziana Margaria, Bernhard Steffen
出版社Springer Verlag
ページ363-374
ページ数12
ISBN(印刷版)9783319519623
DOI
出版ステータスPublished - 2017
イベント43rd Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2017 - Limerick, Ireland
継続期間: 2017 1 162017 1 20

出版物シリーズ

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

Other

Other43rd Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2017
国/地域Ireland
CityLimerick
Period17/1/1617/1/20

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Longest common subsequence in at least k length order-isomorphic substrings」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル