Suffix trees can be used to solve a large number of string problems that occur in text-editing, free-text search, computational biology and other application areas.[22] Primary applications include:[22]