Suffix Arrays on Words

DOI10.1007/978-3-540-73437-6_33zbMath1138.68373OpenAlexW1554611468MaRDI QIDQ3506934

Johannes Fischer, Paolo Ferragina

Publication date: 17 June 2008

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73437-6_33

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items (5)

Extracting the sparse longest common prefix array from the suffix binary search tree ⋮ String matching with alphabet sampling ⋮ Finding range minima in the middle: approximations and applications ⋮ Sparse and Truncated Suffix Trees on Variable-Length Codes ⋮ Inducing Suffix and LCP Arrays in External Memory

This page was built for publication: Suffix Arrays on Words