The following pages link to Suffix array
External toolsShowing 50 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Data structure (links | edit)
- Regular expression (links | edit)
- Regular grammar (links | edit)
- String (computer science) (links | edit)
- SA (links | edit)
- String-searching algorithm (links | edit)
- Trie (links | edit)
- Burrows–Wheeler transform (links | edit)
- Hamming distance (links | edit)
- Suffix (disambiguation) (links | edit)
- Sequence alignment (links | edit)
- List of data structures (links | edit)
- Aho–Corasick algorithm (links | edit)
- Markov algorithm (links | edit)
- Longest common subsequence (links | edit)
- Knuth–Morris–Pratt algorithm (links | edit)
- Pattern matching (links | edit)
- Parsing (links | edit)
- Delta encoding (links | edit)
- Levenshtein distance (links | edit)
- Edit distance (links | edit)
- Udi Manber (links | edit)
- Tandem repeat (links | edit)
- Nondeterministic finite automaton (links | edit)
- Rabin–Karp algorithm (links | edit)
- Boyer–Moore string-search algorithm (links | edit)
- List of terms relating to algorithms and data structures (links | edit)
- Suffix tree (links | edit)
- Trigram search (links | edit)
- Needleman–Wunsch algorithm (links | edit)
- Rope (data structure) (links | edit)
- Suffix Array (redirect page) (links | edit)
- Smith–Waterman algorithm (links | edit)
- Boyer–Moore–Horspool algorithm (links | edit)
- Longest common substring (links | edit)
- Bitap algorithm (links | edit)
- Substring (links | edit)
- Ternary search tree (links | edit)
- Substring index (links | edit)
- Generalized suffix tree (links | edit)
- Levenshtein automaton (links | edit)
- Damerau–Levenshtein distance (links | edit)
- Approximate string matching (links | edit)
- Zhu–Takaoka string matching algorithm (links | edit)
- Sequential pattern mining (links | edit)
- Deterministic acyclic finite state automaton (links | edit)
- Jaro–Winkler distance (links | edit)
- C++ string handling (links | edit)
- Search engine indexing (links | edit)
- Maximal pair (links | edit)