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

DOI10.4230/LIPICS.CPM.2020.12MaRDI QIDQ5874440zbMATH OpenOpenAlexFDO

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

Publication date 7 February 2023

Full work available at URL https://arxiv.org/abs/2002.06796

zbMATH Keywords

pattern matchingstring algorithmsbit parallelismsubsequencescadences

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• scientific article; zbMATH DE number 1438873
• scientific article; zbMATH DE number 1439045
• scientific article; zbMATH DE number 1855601
• scientific article; zbMATH DE number 1985640
• Near-optimal algorithm to count occurrences of subsequences of a given length
• Algorithms and Computation
• Fast algorithms for finding disjoint subsequences with extremal densities
• scientific article; zbMATH DE number 1979633
• Subsequences in bounded ranges: matching and analysis problems
• scientific article; zbMATH DE number 1855595

Cited in

(1)

• Cadences in grammar-compressed strings

This page was built for publication: Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874440)