In this paper we examine string block edit distance, in which two strings A and B are compared by extracting collections of substrings and placing them into correspondence. This model accounts for certain phenomena encountered in important real-world applications, including pen computing and molecular biology. The basic problem admits a family of variations depending on whether the strings must be matched in their entireties, and whether overlap is permitted. We show that several variants are NPcomplete, and give polynomial-time algorithms for solving the remainder.
Lopresti and Tompkins REF compare two strings by extracting collections of substrings and placing them into the corresponding order.
Block edit models for approximate string matching
Theoretical Computer Science
Mathematics Computer Science