A Fast Generic Sequence Matching Algorithm
| dc.creator | Musser, David R. | |
| dc.creator | Nishanov, Gor V. | |
| dc.date | 2008-10-01 | |
| dc.date.accessioned | 2026-07-07T10:06:46Z | |
| dc.date.available | 2026-07-07T10:06:46Z | |
| dc.description | A string matching -- and more generally, sequence matching -- algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of comparisons (2n), and sublinear average-case behavior that is better than that of the fastest versions of the Boyer-Moore algorithm. The algorithm retains its efficiency advantages in a wide variety of sequence matching problems of practical interest, including traditional string matching; large-alphabet problems (as in Unicode strings); and small-alphabet, long-pattern problems (as in DNA searches). Since it is expressed as a generic algorithm for searching in sequences over an arbitrary type T, it is well suited for use in generic software libraries such as the C++ Standard Template Library. The algorithm was obtained by adding to the Knuth-Morris-Pratt algorithm one of the pattern-shifting techniques from the Boyer-Moore algorithm, with provision for use of hashing in this technique. In situations in which a hash function or random access to the sequences is not available, the algorithm falls back to an optimized version of the Knuth-Morris-Pratt algorithm. | |
| dc.identifier | https://arxiv.org/abs/0810.0264 | |
| dc.identifier | http://arxiv.org/abs/0810.0264 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/170438 | |
| dc.subject | Data Structures and Algorithms | |
| dc.title | A Fast Generic Sequence Matching Algorithm | |
| dc.type | text |