15-5 编辑距离
a)Given two sequences x[1 ‥ m] and y[1 ‥ n] and
set of transformation-operation costs, 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 $nds the edit distance from x[1 ‥
m] to y[1 ‥ n] and prints an optimal operation
sequence. Analyze the running time and space
requirements of your algorithm.
、
!
"#$%&$
。
'!
，
(%&) )
%&
，
%&'
，
#(
：
* +',
，
%%&%
%%-.+',/0
评论0