A string algorithm is an algorithm involving the manipulation and properties of strings, or chains of symbols. We can see an example of a (simple) string algorithm in the founding Rosalind problem, in which we are given a DNA string and are asked to return the frequency of each symbol in the string. However, string algorithms can become much more complex, even for simple problems like motif finding (see KMP algorithm).
