Abstract
A cover of a string S is a string C such that every index of S is contained in some occurrence of C. First introduced by Apostolico and Ehrenfeucht [TCS’93] over 30 years ago, covers have since received significant attention in the string algorithms community. In this work, we present a space-efficient algorithm for computing a compact representation of all covers of a given string. Our algorithm requires only O(log n) additional memory while accessing the input string of length n in a read-only manner. Moreover, it runs in O(n) time, matching the best-known time complexity for this problem while achieving an exponential improvement in space usage.
| Original language | English |
|---|---|
| Title of host publication | 36th Annual Symposium on Combinatorial Pattern Matching, CPM 2025 |
| Editors | Paola Bonizzoni, Veli Makinen |
| Publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |
| ISBN (Electronic) | 9783959773690 |
| DOIs | |
| State | Published - 10 Jun 2025 |
| Externally published | Yes |
| Event | 36th Annual Symposium on Combinatorial Pattern Matching, CPM 2025 - Milan, Italy Duration: 17 Jun 2025 → 19 Jun 2025 |
Publication series
| Name | Leibniz International Proceedings in Informatics, LIPIcs |
|---|---|
| Volume | 331 |
| ISSN (Print) | 1868-8969 |
Conference
| Conference | 36th Annual Symposium on Combinatorial Pattern Matching, CPM 2025 |
|---|---|
| Country/Territory | Italy |
| City | Milan |
| Period | 17/06/25 → 19/06/25 |
Bibliographical note
Publisher Copyright:© Itai Boneh and Shay Golan;
Keywords
- Cover
- Read-only random access
- small space