3 ms·
A lot of problems on sequences are amendable to dynamic programming. Two other famous ones are Smith-Waterman and Needleman-Wunsch for finding optimal global an
by shaki-dora 7y ago
A lot of problems on sequences are amendable to dynamic programming. Two other famous ones are Smith-Waterman and Needleman-Wunsch for finding optimal global and local alignments of sequences–a typical problem in genetics.
- marton78 7y agoThe Levenshtein distance, which finds the fewest edits to transform one string to another is also a classical example.