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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationSOFSEM 2017
Subtitle of host publicationTheory and Practice of Computer Science - 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings
EditorsChristel Baier, Mark van den Brand, Johann Eder, Mike Hinchey, Tiziana Margaria, Bernhard Steffen
PublisherSpringer Verlag
Pages363-374
Number of pages12
ISBN (Print)9783319519623
DOIs
Publication statusPublished - 2017 Jan 1
Event43rd Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2017 - Limerick, Ireland
Duration: 2017 Jan 162017 Jan 20

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10139 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

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

Keywords

  • Dynamic programming
  • Longest common subsequence
  • Order-isomorphism
  • Order-preserving matching

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Longest common subsequence in at least k length order-isomorphic substrings'. Together they form a unique fingerprint.

  • Cite this

    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. In C. Baier, M. van den Brand, J. Eder, M. Hinchey, T. Margaria, & B. Steffen (Eds.), 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); Vol. 10139 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-51963-0_28