๐Ÿ“–
Fast computation of the period and of the shortest cover of a string using its Character-Distance-Sampling representation
Thierry Lecroq, Francesco Pio Marino

Fast computation of the period and of the shortest cover of a string using its Character-Distance-Sampling representation

Author / Organization:
Science & Mathematics Published 2026 Verification Pending

Overview & Synopsis

Computing regularities in strings is essential for a better understanding of their structures. Among regularities, periods and covers are the easiest to compute and the more informative. Lately new interesting string matching results have been achieved using different sampling techniques. One of these technique, called Character-Distance-Sampling (\texttt{CDS}) consists of representing a string by storing the distance between the positions of selected characters called pivots. Here we select as pivots only the first character of the string and use its \texttt{CDS} representation for computing its period and its shortest cover. Experimental results show that the proposed methods are much faster than classical methods for computing these two features.

Indexed from repository: HAL Open Science (hal.science)
Loading document from verified source...
Keyboard Shortcuts: ← / → for pages • + / - for zoom • 0 to fit width Powered by Mozilla PDF.js v3.11

Document Information

Document Title Fast computation of the period and of the shortest cover of a string using its Character-Distance-Sampling representation
Author / Organization Thierry Lecroq, Francesco Pio Marino
Subject & Discipline Multidisciplinary Academic Open Research
Categories Science & Mathematics
Publication Year 2026
License / Rights Open Access / Creative Commons
Resource Verification Listed PDF (Verification Pending)
Original Host Website HAL Open Science (hal.science)
File Format application/pdf (Portable Document Format)
Language EN
Catalog ID DOC-185091
Original Source Link Visit Source Page on hal.science »