A Near-Optimal Algorithm to Count Occurrences of Subsequences of a Given Length

一种用于统计给定长度子序列出现次数的近优算法