Advanced String Structures
When to Use
- Trie: prefix search, autocomplete, k-mer membership testing
- Aho-Corasick: find all occurrences of k patterns in one O(n) pass
- Suffix Array + LCP: genome-wide pattern search, longest repeated substring, k-mer counting
- Suffix Tree: O(m) pattern match, longest common substring, tandem repeat detection
Complexity Table
| Structure | Build | Pattern Search | Space |
|---|---|---|---|
| Trie | O(n·m) |
[Description truncada. Veja o README completo no GitHub.]