Testing Quasiperiodicity
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866912650755047424 |
|---|---|
| author | Awofeso, Christine Bals, Ben Lachish, Oded Pissis, Solon P. |
| author_facet | Awofeso, Christine Bals, Ben Lachish, Oded Pissis, Solon P. |
| contents | A cover (or quasiperiod) of a string $S$ is a shorter string $C$ such that every position of $S$ is contained in some occurrence of $C$ as a substring. The notion of covers was introduced by Apostolico and Ehrenfeucht over 30 years ago [Theor. Comput. Sci. 1993] and it has received significant attention from the combinatorial pattern matching community. In this note, we show how to efficiently test whether $S$ admits a cover. Our tester can also be translated into a streaming algorithm. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_02231 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Testing Quasiperiodicity Awofeso, Christine Bals, Ben Lachish, Oded Pissis, Solon P. Data Structures and Algorithms Discrete Mathematics A cover (or quasiperiod) of a string $S$ is a shorter string $C$ such that every position of $S$ is contained in some occurrence of $C$ as a substring. The notion of covers was introduced by Apostolico and Ehrenfeucht over 30 years ago [Theor. Comput. Sci. 1993] and it has received significant attention from the combinatorial pattern matching community. In this note, we show how to efficiently test whether $S$ admits a cover. Our tester can also be translated into a streaming algorithm. |
| title | Testing Quasiperiodicity |
| topic | Data Structures and Algorithms Discrete Mathematics |
| url | https://arxiv.org/abs/2508.02231 |