摘要：
Aho Corasick algorithm Let there be a set of strings with the total length $m$ (sum of all lengths). The Aho Corasick algorithm constructs a data stru 阅读全文
摘要：
<! ?title Finding repetitions Finding repetitions Given a string $s$ of length $n$. A repetition is two occurrences of a string in a row. In other wor 阅读全文
摘要：
Suffix Automaton A suffix automaton is a powerful data structure that allows solving many string related problems. For example, you can search for all 阅读全文
摘要：
Z function and its calculation Suppose we are given a string $s$ of length $n$. The Z function for this string is an array of length $n$ where the $i$ 阅读全文
摘要：
Prefix function. Knuth–Morris–Pratt algorithm Prefix function definition You are given a string $s$ of length $n$. The prefix function for this string 阅读全文
摘要：
<! ?title Suffix Array Suffix Array Definition Let $s$ be a string of length $n$. The $i$ th suffix of $s$ is the substring $s[i \ldots n 1]$. A suffi 阅读全文