Fast and Lightweight LCP-Array Construction Algorithms
From MaRDI portal
Publication:5233694
DOI10.1137/1.9781611972917.3zbMath1430.68041arXiv1012.4263OpenAlexW2406552807MaRDI QIDQ5233694
Publication date: 12 September 2019
Published in: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1012.4263
Analysis of algorithms (68W40) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)
Related Items (9)
Lightweight LCP construction for very large collections of strings ⋮ GLOUDS: representing tree-like graphs ⋮ Optimal suffix sorting and LCP array construction for constant alphabets ⋮ Better External Memory LCP Array Construction ⋮ Burrows-Wheeler transform and LCP array construction in constant space ⋮ Inducing enhanced suffix arrays for string collections ⋮ The exact multiple pattern matching problem solved by a reference tree approach ⋮ Inducing Suffix and LCP Arrays in External Memory ⋮ LCP Array Construction in External Memory
This page was built for publication: Fast and Lightweight LCP-Array Construction Algorithms
