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

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

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

1 被引用数 (Scopus)

抄録

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.

本文言語英語
ホスト出版物のタイトル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
出版ステータス出版済み - 6 1 2020
イベント31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020 - Copenhagen, デンマーク
継続期間: 6 17 20206 19 2020

出版物シリーズ

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

会議

会議31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020
国/地域デンマーク
CityCopenhagen
Period6/17/206/19/20

All Science Journal Classification (ASJC) codes

  • ソフトウェア

フィンガープリント

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

引用スタイル