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

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

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

Abstract

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.

Original languageEnglish
Title of host publication31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020
EditorsInge Li Gortz, Oren Weimann
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959771498
DOIs
Publication statusPublished - Jun 1 2020
Event31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020 - Copenhagen, Denmark
Duration: Jun 17 2020Jun 19 2020

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume161
ISSN (Print)1868-8969

Conference

Conference31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020
CountryDenmark
CityCopenhagen
Period6/17/206/19/20

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint Dive into the research topics of 'Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences'. Together they form a unique fingerprint.

  • Cite this

    Funakoshi, M., Nakashima, Y., Inenaga, S., Bannai, H., Takeda, M., & Shinohara, A. (2020). Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences. In I. L. Gortz, & O. Weimann (Eds.), 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020 [12] (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 161). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.CPM.2020.12