2026-08-10T22:48:24Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:12421 2024-03-06T10:50:05Z ddc:004 open_access

Space Efficient Construction of Lyndon Arrays in Linear Time Bille, Philip Ellert, Jonas Fischer, Johannes Gørtz, Inge Li Kurpicz, Florian Munro, J. Ian Rotenberg, Eva String algorithms string suffixes succinct data structures Lyndon word Lyndon array nearest smaller values nearest smaller suffixes Given a string S of length n, its Lyndon array identifies for each suffix S[i..n] the next lexicographically smaller suffix S[j..n], i.e. the minimal index j > i with S[i..n] ≻ S[j..n]. Apart from its plain (n log₂ n)-bit array representation, the Lyndon array can also be encoded as a succinct parentheses sequence that requires only 2n bits of space. While linear time construction algorithms for both representations exist, it has previously been unknown if the same time bound can be achieved with less than Ω(n lg n) bits of additional working space. We show that, in fact, o(n) additional bits are sufficient to compute the succinct 2n-bit version of the Lyndon array in linear time. For the plain (n log₂ n)-bit version, we only need 𝒪(1) additional words to achieve linear time. Our space efficient construction algorithm makes the Lyndon array more accessible as a fundamental data structure in applications like full-text indexing. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Philip Bille and Jonas Ellert and Johannes Fischer and Inge Li Gørtz and Florian Kurpicz and J. Ian Munro and Eva Rotenberg 2020 Is Part Of LIPIcs, Volume 168, 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ICALP.2020.14 urn:nbn:de:0030-drops-124211 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.14 eng https://creativecommons.org/licenses/by/3.0/legalcode