1 research outputs found
Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences
The equidistant subsequence pattern matching problem is considered. Given a
pattern string and a text string , we say that is an
\emph{equidistant subsequence} of if is a subsequence of the text such
that consecutive symbols of 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 time
algorithms for finding -(sub-)cadences and equidistant subsequences.
Furthermore, and time algorithms, respectively for
equidistant and Abelian equidistant matching for the case , are shown.
The algorithms make use of a technique that was recently introduced which can
efficiently compute convolutions with linear constraints