Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences

Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara

研究成果: Conference contribution

抄録

The equidistant subsequence pattern matching problem is considered. Given a pattern string P and a text string T, we say that P is an equidistant subsequence of T if P is a subsequence of the text such that consecutive symbols of P in the occurrence are equally spaced. We can consider the problem of equidistant subsequences as generalizations of (sub-)cadences. We give bit-parallel algorithms that yield o(n2) time algorithms for finding k-(sub-)cadences and equidistant subsequences. Furthermore, O(n log2 n) and O(n log n) time algorithms, respectively for equidistant and Abelian equidistant matching for the case P = 3, are shown. The algorithms make use of a technique that was recently introduced which can efficiently compute convolutions with linear constraints. 2012 ACM Subject Classification Mathematics of computing ! Combinatorial algorithms.

本文言語English
ホスト出版物のタイトル31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020
編集者Inge Li Gortz, Oren Weimann
出版社Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN(電子版)9783959771498
DOI
出版ステータスPublished - 2020 6 1
イベント31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020 - Copenhagen, Denmark
継続期間: 2020 6 172020 6 19

出版物シリーズ

名前Leibniz International Proceedings in Informatics, LIPIcs
161
ISSN(印刷版)1868-8969

Conference

Conference31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020
CountryDenmark
CityCopenhagen
Period20/6/1720/6/19

ASJC Scopus subject areas

  • Software

フィンガープリント 「Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル