The local alignment problem takes two (typically genetic strings $s$ and $t$ (typically genetic strings) along with an alignment score and asks for a local alignment of $s$ and $t$ that maximizes this score over all possible substrings of $s$ and $t$.

The practical purpose of the local alignment problem is to find the most similar small regions in the two given strings.