Compressed suffix trees

DOI10.1145/2444016.2461327zbMath1322.68253OpenAlexW2000788935MaRDI QIDQ5178740

Simon Gog, Enno Ohlebusch

Publication date: 16 March 2015

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2444016.2461327

zbMATH Keywords

Burrows-Wheeler transformtext compressiontext indexingalgorithm engineeringwavelet treebalanced parenthesesLCP-array

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Data structures (68P05) Information storage and retrieval of data (68P20) Algorithms on strings (68W32)

Related Items (8)

Longest Common Prefix with Mismatches ⋮ The longest common substring problem ⋮ Computing the Burrows-Wheeler transform of a string and its reverse in parallel ⋮ Lightweight BWT and LCP Merging via the Gap Algorithm ⋮ Tighter bounds for the sum of irreducible LCP values ⋮ Burrows-Wheeler transform and LCP array construction in constant space ⋮ Unnamed Item ⋮ Lightweight merging of compressed indices based on BWT variants

This page was built for publication: Compressed suffix trees