原书出处
Introduction to Algorithms, Fourth Edition
14 第14章 动态规划
Given two sequences x[1 : m] and y[1 : n] and the costs of the transformation operations,
the edit distance from x to y is the cost of the least expensive operation sequence that transforms x to y.
Describe a dynamic-programming algorithm that finds the edit distance from x[1 : m] to y[
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter014.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea