2026-07-21T12:28:51Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:23099 2025-10-02T12:37:27Z ddc:004 open_access

Covers in Optimal Space Boneh, Itai Golan, Shay Cover Read-only random access small space 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Itai Boneh and Shay Golan 2025 Is Part Of LIPIcs, Volume 331, 36th Annual Symposium on Combinatorial Pattern Matching (CPM 2025) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CPM.2025.5 urn:nbn:de:0030-drops-230993 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2025.5 eng https://creativecommons.org/licenses/by/4.0/legalcode