2026-07-22T03:56:53Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:23916 2026-02-09T06:23:56Z ddc:004 open_access

A Taxonomy of LCP-Array Construction Algorithms Fischer, Johannes Ohlebusch, Enno longest common prefix array suffix array Burrows-Wheeler transform The combination of the suffix array and the LCP-array can be used to solve many string processing problems efficiently. We review some of the most important sequential LCP-array construction algorithms in random access memory. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Johannes Fischer and Enno Ohlebusch 2025 Is Part Of OASIcs, Volume 131, The Expanding World of Compressed Data: A Festschrift for Giovanni Manzini's 60th Birthday (2025) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.Manzini.8 urn:nbn:de:0030-drops-239166 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.Manzini.8 eng https://creativecommons.org/licenses/by/4.0/legalcode