A Near-Optimal Algorithm to Count Occurrences of Subsequences of a Given Length
{{output}}
For k ∈ ℤ+, define Σ k as the set of integers {0, 1, …, k - 1}. Given an integer n and a string t of length m ≥ n over Σ k , we count the number of times that each one of the kn distinct strings of length n over Σ k occurs as a subsequence of t. Our alg... ...
