String algorithms
From Algorithm wiki
[edit] String algorithms list
- Reverse string
- Aho-Corasick algorithm: trie based algorithm for finding all matches in dictionary.
- Bitap algorithm: fuzzy algorithm that determines strings are approximately equal.
- Boyer Moore String searching: amortised linear (sublinear in most times) algorithm
- Knuth-Morris-Pratt algorithm: bypasses reexamination of matched characters
- Rabin-Karp string search algorithm: searches multiple patterns efficiently
- Longest common sub-sequence: Haskell's dynamic programming algorithm
- Longest increasing subsequence problem
- Shortest common supersequence problem
- longest common substring problem
- Kadane's algorithm: finds maximum sub-array of any size
- Boyer-Moore-Horspool algorithm

