TY - GEN
T1 - Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences
AU - Funakoshi, Mitsuru
AU - Nakashima, Yuto
AU - Inenaga, Shunsuke
AU - Bannai, Hideo
AU - Takeda, Masayuki
AU - Shinohara, Ayumi
N1 - Funding Information:
Funding Mitsuru Funakoshi: JSPS KAKENHI Grant Number JP20J21147. Yuto Nakashima: JSPS KAKENHI Grant Number JP18K18002. Shunsuke Inenaga: JSPS KAKENHI Grant Number JP17H01697, JST PRESTO Grant Number JPMJPR1922. Hideo Bannai: JSPS KAKENHI Grant Numbers JP16H02783, JP20H04141. Masayuki Takeda: JSPS KAKENHI Grant Number JP18H04098. Ayumi Shinohara: JSPS KAKENHI Grant Number JP15H05706.
Publisher Copyright:
© 2020 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All rights reserved.
Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.
PY - 2020/6/1
Y1 - 2020/6/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85088379370&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85088379370&partnerID=8YFLogxK
U2 - 10.4230/LIPIcs.CPM.2020.12
DO - 10.4230/LIPIcs.CPM.2020.12
M3 - Conference contribution
AN - SCOPUS:85088379370
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020
A2 - Gortz, Inge Li
A2 - Weimann, Oren
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
T2 - 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020
Y2 - 17 June 2020 through 19 June 2020
ER -