Abstract
Let X and Y be any two strings of finite lengths N and M, respectively, over a finite alphabet. An edit distance between X and Y is defined as the minimum sum of elementary edit distances associated with edit operations of substitutions, deletions, and insertions needed to transform X to Y. In this paper, the problem of efficient computation of such a distance is considered under the assumption that the numbers of edit operations are limited and that the maximum lengths, F and G, of runs of deletions and insertions are given, respectively. Besides, the edit sequence is ordered in a sense that between every two successive runs of substitutions there can be either at most one run of deletions followed by at most one run of insertions or just one run of deletions or insertions. An algorithm is derived that computes the minimum edit distance associated with editing X to Y subject to the specified constraints. The algorithm requires O( NM min { N, M}) time and O( NM) space. Possible applications for the synchronization error-correcting codes and for the cryptanalysis of certain stream ciphers are also discussed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.