We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...
In various applications such as data cleansing, being able to retrieve categorical or numerical attributes based on notions of approximate match (e.g., edit distance, numerical di...
Liang Jin, Nick Koudas, Chen Li, Anthony K. H. Tun...
— A new technique that makes use of a systolic array structure is proposed for solving the common approximate substring (CAS) problem. This approach extends the technique introdu...
A novel technique is presented in this paper to extract strings in color images of both Business Settlement Plan (BSP) and non-BSP airline coupon. The essential concept is to remo...
Edit distance has been extensively studied for the past several years. Nevertheless, no linear-time algorithm is known to compute the edit distance between two strings, or even to...
Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, ...