Optimal-Hash Exact String Matching Algorithms
Data Structures and Algorithms
2023-03-13 v1
Abstract
String matching is the problem of finding all the occurrences of a pattern in a text. We propose improved versions of the fast family of string matching algorithms based on hashing -grams. The improvement consists of considering minimal values such that each -grams of the pattern has a unique hash value. The new algorithms are fastest than algorithm of the HASH family for short patterns on large size alphabets.
Keywords
Cite
@article{arxiv.2303.05799,
title = {Optimal-Hash Exact String Matching Algorithms},
author = {Thierry Lecroq},
journal= {arXiv preprint arXiv:2303.05799},
year = {2023}
}
Comments
14 pages