Optimal Lightweight Construction of Suffix Arrays for Constant Alphabets

DOI10.1007/978-3-540-73951-7_53zbMath1209.68163OpenAlexW1546294986MaRDI QIDQ3603562

Sen Zhang, Ge Nong

Publication date: 17 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73951-7_53

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Algorithms on strings (68W32)

Related Items (4)

Suffix-sorting via Shannon-Fano-Elias codes ⋮ Optimal in-place suffix sorting ⋮ A quick tour on suffix arrays and compressed suffix arrays ⋮ Linear Time Suffix Array Construction Using D-Critical Substrings

This page was built for publication: Optimal Lightweight Construction of Suffix Arrays for Constant Alphabets