A lot of problems on sequences are amendable to dynamic programming. Two other f... | Hacker News

Hacker News new | past | comments | ask | show | jobs | submit

login

shaki-dora on June 26, 2019 | parent | context | favorite | on: Real-world dynamic programming: seam carving

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 on June 26, 2019 [–]

The Levenshtein distance, which finds the fewest edits to transform one string to another is also a classical example.

Consider applying for YC's Summer 2025 batch! Applications are open till May 13
Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact