实现最小编辑距离算法，并给出完整的编辑过程，完整版源码，已调试通过-To achieve the minimum edit distance algorithm, and gives the complete editing process, full version of source code, has been debugging through the

这是模式识别中模板匹配内容的Matlab例程，其中edit_distance程序用来计算两个符号字符串间的编辑距离； back-tracking程序是“回溯”法画出最佳路径的代价网格； Dtw-Sakoe.m程序是具有Sakoe-Chiba局部路径约束的动态时间弯 折。-This is a pattern recognition template matching the content of Matlab routi

字符串的编辑距离也被称为Levenshtein距离（Levenshtein Distance），一般用动态规划来实现。属于经典算法。-Edit distance of the string is also known as the Levenshtein distance (Distance Levenshtein), the general use of dynamic programming to achieve. Belong t