A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We consider external inverse pattern matching problem. Given a text T of length n over an ordered alphabet , such that j j = , and a number m n. The entire problem is to nd a patternP MAX 2 m which is not a subword of T and which maximizes the sum of Hamming distances betweenP MAX and all subwords of T of length m. We present optimal O(n log )-time algorithm for the external inverse pattern matching problem which substantially improves the only known polynomial O(nm log )-time algorithmdoi:10.1007/3-540-63220-4_53 fatcat:hsoif5hterehdczipwca4io5qq