Editing List of algorithms (section)

====Substrings====
{{further|Substrings}}
* [[Kadane's algorithm]]: finds the contiguous subarray with largest sum in an array of numbers
* [[Longest common substring problem]]: find the longest string (or strings) that is a substring (or are substrings) of two or more strings
* [[Substring search]]
** [[Aho–Corasick string matching algorithm]]: [[trie]] based algorithm for finding all substring matches to any of a finite set of strings
** [[Boyer–Moore string-search algorithm]]: amortized linear ([[sublinear]] in most times) algorithm for substring search
** [[Boyer–Moore–Horspool algorithm]]: Simplification of Boyer–Moore
** [[Knuth–Morris–Pratt algorithm]]: substring search which bypasses reexamination of matched characters
** [[Rabin–Karp string search algorithm]]: searches multiple patterns efficiently
** [[Zhu–Takaoka string matching algorithm]]: a variant of Boyer–Moore
* [[Ukkonen's algorithm]]: a [[linear-time]], [[online algorithm]] for constructing [[suffix tree]]s
* [[Matching wildcards]]
** [[InterNetNews|Rich Salz]]' [[wildmat]]: a widely used [[Open-source software|open-source]] [[recursion|recursive]] algorithm
** [[Krauss matching wildcards algorithm]]: an open-source non-recursive algorithm