Report
Optimal-Hash Exact String Matching Algorithms
| العنوان: | Optimal-Hash Exact String Matching Algorithms |
|---|---|
| المؤلفون: | Lecroq, Thierry |
| سنة النشر: | 2023 |
| المجموعة: | Computer Science |
| مصطلحات موضوعية: | Computer Science - Data Structures and Algorithms |
| الوصف: | 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 $q$-grams. The improvement consists of considering minimal values $q$ such that each $q$-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. Comment: 14 pages |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/2303.05799 |
| رقم الانضمام: | edsarx.2303.05799 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |