在日常应用中，文本比较是一个比较常见的问题。文本比较算法也是一个老生常谈的话题-In everyday applications, the text comparison, is a relatively common problem of text comparison algorithm is a cliche topic

本文介绍基于最长公共子串的文本比较算法——Needleman/Wunsch算法。-In this paper, the text comparison algorithm based on the longest common substring Needleman/Wunsch algorithm

文本比较算法Ⅵ——用线性空间计算最大公共子序列（翻译贴）-Text comparison with linear space algorithm calculating maximum public subsequence (translation is stuck