String Distance Functions:

Hamming distance
Levenshtein distance
General Levenshtein distance
Damerau-Levenshtein distance

 

Alignment Algorithms:

global alignment of Needleman and Wunsch, quadratic space
global alignment of Needleman and Wunsch, quadratic space, affine gap cost
local alignment of Smith and Waterman, quadratic space
local alignment of Smith and Waterman, quadratic space, affine gap
longest common subsequence

 

Exact String Matching Algorithms:

Karp and Rabin
Morris and Pratt
Knuth, Morris and Pratt
Galil and Seiferas
Boyer and Moore (also turbo and tuned version)
Zhu and Takaoka
Berry and Ravindran
Smith
Raita
Horspool
brute force method
shoft-or method
reverse colussi method
and several more.

 

More Information in the Manual / Alignment Data Types.