Longest Common Rollercoasters

Kosuke Fujita, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

抄録

For an integer k≥ 3, a k-rollercoaster is a numeric string such that any maximal strictly non-increasing or non-decreasing substring has length at least k. We consider the problem of computing the longest common k-rollercoaster between two integer strings S and T, i.e., the longest k-rollercoaster that is a subsequence common to both S and T. We give two algorithms that solve this problem; The first runs in O(nmk) time and space, where n, m are respectively the lengths of S and T. The second runs in O(rklog 3mlog log m) time and O(rk) space, where r= O(mn) is the number of pairs (i, j) of matching points such that S[ i] = T[ j], assuming that m≤ n and that S, T only consist of characters which occur in both strings. The second algorithm is faster than the first one when r is sub-linear in nm/log3mloglogm.

本文言語英語
ホスト出版物のタイトルString Processing and Information Retrieval - 28th International Symposium, SPIRE 2021, Proceedings
編集者Thierry Lecroq, Hélène Touzet
出版社Springer Science and Business Media Deutschland GmbH
ページ21-32
ページ数12
ISBN(印刷版)9783030866914
DOI
出版ステータス出版済み - 2021
イベント28th International Symposium on String Processing and Information Retrieval, SPIRE 2021 - Virtual, Online
継続期間: 10 4 202110 6 2021

出版物シリーズ

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

会議

会議28th International Symposium on String Processing and Information Retrieval, SPIRE 2021
CityVirtual, Online
Period10/4/2110/6/21

All Science Journal Classification (ASJC) codes

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

フィンガープリント

「Longest Common Rollercoasters」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル