... pairs¹

This algorithm has been well described in the literature. Finding the cost of the best alignment, and producing the aligned sequences can be done with m_A m_B evaluations of C and $O( \min (m_A,m_B))$ storage for sequences A and B with lengths m_A and m_B.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.