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

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

3 引用 (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.

元の言語英語
ホスト出版物のタイトル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
出版物ステータス出版済み - 1 1 2017
イベント43rd Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2017 - Limerick, アイルランド
継続期間: 1 16 20171 20 2017

出版物シリーズ

名前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

その他

その他43rd Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2017
アイルランド
Limerick
期間1/16/171/20/17

Fingerprint

Longest Common Subsequence
Isomorphic
Subsequence
Strings
Restriction

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

これを引用

Ueki, Y., Diptarama, Kurihara, M., Matsuoka, Y., Narisawa, K., Yoshinaka, R., ... Shinohara, A. (2017). Longest common subsequence in at least k length order-isomorphic substrings. : C. Baier, M. van den Brand, J. Eder, M. Hinchey, T. Margaria, & B. Steffen (版), SOFSEM 2017: Theory and Practice of Computer Science - 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings (pp. 363-374). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 10139 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-51963-0_28

Longest common subsequence in at least k length order-isomorphic substrings. / Ueki, Yohei; Diptarama; Kurihara, Masatoshi; Matsuoka, Yoshiaki; Narisawa, Kazuyuki; Yoshinaka, Ryo; Bannai, Hideo; Inenaga, Shunsuke; Shinohara, Ayumi.

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, 2017. p. 363-374 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻 10139 LNCS).

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

Ueki, Y, Diptarama, Kurihara, M, Matsuoka, Y, Narisawa, K, Yoshinaka, R, Bannai, H, Inenaga, S & Shinohara, A 2017, Longest common subsequence in at least k length order-isomorphic substrings. : C Baier, M van den Brand, J Eder, M Hinchey, T Margaria & B Steffen (版), SOFSEM 2017: Theory and Practice of Computer Science - 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 巻. 10139 LNCS, Springer Verlag, pp. 363-374, 43rd Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2017, Limerick, アイルランド, 1/16/17. https://doi.org/10.1007/978-3-319-51963-0_28
Ueki Y, Diptarama, Kurihara M, Matsuoka Y, Narisawa K, Yoshinaka R その他. Longest common subsequence in at least k length order-isomorphic substrings. : Baier C, van den Brand M, Eder J, Hinchey M, Margaria T, Steffen B, 編集者, SOFSEM 2017: Theory and Practice of Computer Science - 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. Springer Verlag. 2017. p. 363-374. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-51963-0_28
Ueki, Yohei ; Diptarama ; Kurihara, Masatoshi ; Matsuoka, Yoshiaki ; Narisawa, Kazuyuki ; Yoshinaka, Ryo ; Bannai, Hideo ; Inenaga, Shunsuke ; Shinohara, Ayumi. / Longest common subsequence in at least k length order-isomorphic substrings. 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, 2017. pp. 363-374 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{80a3340803ab42119b422aa1fac3b11f,
title = "Longest common subsequence in at least k length order-isomorphic substrings",
abstract = "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.",
author = "Yohei Ueki and Diptarama and Masatoshi Kurihara and Yoshiaki Matsuoka and Kazuyuki Narisawa and Ryo Yoshinaka and Hideo Bannai and Shunsuke Inenaga and Ayumi Shinohara",
year = "2017",
month = "1",
day = "1",
doi = "10.1007/978-3-319-51963-0_28",
language = "English",
isbn = "9783319519623",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "363--374",
editor = "Christel Baier and {van den Brand}, Mark and Johann Eder and Mike Hinchey and Tiziana Margaria and Bernhard Steffen",
booktitle = "SOFSEM 2017",
address = "Germany",

}

TY - GEN

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

AU - Ueki, Yohei

AU - Diptarama,

AU - Kurihara, Masatoshi

AU - Matsuoka, Yoshiaki

AU - Narisawa, Kazuyuki

AU - Yoshinaka, Ryo

AU - Bannai, Hideo

AU - Inenaga, Shunsuke

AU - Shinohara, Ayumi

PY - 2017/1/1

Y1 - 2017/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85010689117&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85010689117&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-51963-0_28

DO - 10.1007/978-3-319-51963-0_28

M3 - Conference contribution

SN - 9783319519623

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

SP - 363

EP - 374

BT - SOFSEM 2017

A2 - Baier, Christel

A2 - van den Brand, Mark

A2 - Eder, Johann

A2 - Hinchey, Mike

A2 - Margaria, Tiziana

A2 - Steffen, Bernhard

PB - Springer Verlag

ER -