Compressed suffix trees, efficient computation and storage of LCP-values

DOI10.1145/2444016.2461327MaRDI QIDQ5178740zbMATH OpenOpenAlexFDO

Authors 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

algorithm engineeringbalanced parenthesesBurrows-Wheeler transformLCP-arraytext compressiontext indexingwavelet tree

Mathematics Subject Classification ID

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

Recommendations

• Fast and Lightweight LCP-Array Construction Algorithms
• Fully-Compressed Suffix Trees
• Fully compressed suffix trees
• Engineering a compressed suffix tree implementation
• scientific article; zbMATH DE number 2119665

Cited in

(18)

• Truncated suffix trees and their application to data compression.
• Lightweight merging of compressed indices based on BWT variants
• Computing the Burrows-Wheeler transform of a string and its reverse in parallel
• Faster repetition-aware compressed suffix trees based on block trees
• Compressed Cache-Oblivious String B-tree
• Longest common prefix with mismatches
• The longest common substring problem
• Fully compressed suffix trees
• scientific article; zbMATH DE number 2119665 (Why is no real title available?)
• scientific article; zbMATH DE number 871936 (Why is no real title available?)
• Tighter bounds for the sum of irreducible LCP values
• External memory BWT and LCP computation for sequence collections with applications
• Burrows-Wheeler transform and LCP array construction in constant space
• Lightweight BWT and LCP merging via the gap algorithm
• Engineering a compressed suffix tree implementation
• Fully-Compressed Suffix Trees
• Exploiting new properties of string net frequency for efficient computation
• Replacing suffix trees with enhanced suffix arrays

This page was built for publication: Compressed suffix trees, efficient computation and storage of LCP-values

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5178740)