Abstract
The string matching with mismatches problem is that of finding the number of mismatches between pattern P of length m and every length m substring of the text T. Currently, the best algorithms for this problem are the following. The Landau-Vishkin algorithm finds all locations where the pattern has at most k errors (where k is part of the input) in time O(nk). The Abrahamson algorithm finds the number of mismatches at every location in time O(n√m log m). We present an algorithm that is faster than both. Our algorithm finds all locations where the pattern has at most k errors in time O(n√k log k). We also show an algorithm that solves the above problem in time O((n+nk3/m) log k).
| Original language | English |
|---|---|
| Pages | 794-803 |
| Number of pages | 10 |
| State | Published - 2000 |
| Event | 11th Annual ACM-SIAM Symposium on Discrete Algorithms - San Francisco, CA, USA Duration: 9 Jan 2000 → 11 Jan 2000 |
Conference
| Conference | 11th Annual ACM-SIAM Symposium on Discrete Algorithms |
|---|---|
| City | San Francisco, CA, USA |
| Period | 9/01/00 → 11/01/00 |
Bibliographical note
Funding Information:* Corresponding author. E-mail addresses: [email protected] (A. Amir), [email protected] (M. Lewenstein), [email protected] (E. Porat). 1 Partially supported by NSF grant CCR-96-10170, BSF grant 96-00509, and a BIU internal research grant.