The longest common subsequence (LCS) problem is a classical problem in
computer science. The semi-local LCS problem is a generalisation of the LCS
problem, arising naturally in the context of string comparison.
Dot plots are a standard method for local comparison of biological sequences.
In a dot plot, a substring to substring distance is computed for all pairs of
fixed-size windows in the input strings. Commonly, the Hamming distance is used
since it can be computed in linear time. However, the Hamming distance is a
rather crude measure of string similarity, and using an alignment-based edit
distance can greatly improve the sensitivity of the dot plot method.