LCS Publication Details
Publication Title: A FASTER ALGORITHM COMPUTING STRING EDIT DISTANCES
Publication Author: Masek, William J.
Additional Authors: Paterson, Michael S.
LCS Document Number: MIT-LCS-TM-105
Publication Date: 5-1-1978
LCS Group: No Group Specified
Additional URL: No URL Given
Abstract:
The edit-distance between two character strings can be defined as the minimum cost of a sequence of editing operations which transforms one string into the other. The operations allowed are deleting, inserting and replacing one symbol at a time, with possibly different costs for each of these operations. The problem of finding the longest common subsequence of two strings is a special case of the problem of computing edit-distances.
To obtain this publication:

    To purchase a printed copy of this publication please contact MIT Document Services.