Sequence comparison by dynamic programming
Biometrika · 1975 · Volume 62 · Issue 3
Abstract
SUMMARY A dynamic programming algorithm is proposed for slotting together two ordered sequences in an optimal manner. Computational experience is discussed.
Enable JavaScript for citation tools and additional paper interactions.