Optimal suffix sorting and LCP array construction for constant alphabets

DOI10.1016/j.ipl.2016.09.010zbMath1393.68046OpenAlexW2522274631MaRDI QIDQ344531

Guilherme P. Telles, Felipe A. Louza, Simon Gog

Publication date: 23 November 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2016.09.010

zbMATH Keywords

data structureslinear timesuffix arrayconstant spaceLCP array

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Data structures (68P05)

Related Items (2)

Burrows-Wheeler transform and LCP array construction in constant space ⋮ Inducing enhanced suffix arrays for string collections

Cites Work

• Unnamed Item
• Unnamed Item
• Space efficient linear time construction of suffix arrays
• Suffix Arrays: A New Method for On-Line String Searches
• A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
• Permuted Longest-Common-Prefix Array
• Inducing the LCP-Array
• Fast and Lightweight LCP-Array Construction Algorithms
• Two Efficient Algorithms for Linear Time Suffix Array Construction

This page was built for publication: Optimal suffix sorting and LCP array construction for constant alphabets