Pages that link to "Item:Q5367537"
From MaRDI portal
The following pages link to Near-optimal algorithm to count occurrences of subsequences of a given length (Q5367537):
Displaying 5 items.
- The submatrices character count problem: An efficient solution using separable values (Q598188) (← links)
- Efficient counting of square substrings in a tree (Q2250458) (← links)
- Algorithms for subsequence combinatorics (Q2378518) (← links)
- Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence (Q2904488) (← links)
- Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences (Q5874440) (← links)