The compressed permuterm index
From MaRDI portal
Publication:3188992
DOI10.1145/1868237.1868248zbMath1295.68108OpenAlexW2050635028MaRDI QIDQ3188992
Paolo Ferragina, Rossano Venturini
Publication date: 9 September 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1868237.1868248
Searching and sorting (68P10) Database theory (68P15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information storage and retrieval of data (68P20) Algorithms on strings (68W32)
Related Items (11)
Compressed string dictionary search with edit distance one ⋮ Wheeler graphs: a framework for BWT-based data structures ⋮ A new class of string transformations for compressed text indexing ⋮ Compressed string dictionaries via data-aware subtrie compaction ⋮ On optimally partitioning a text to improve its compression ⋮ Lempel-Ziv-78 compressed string dictionaries ⋮ On the Hardness and Inapproximability of Recognizing Wheeler Graphs ⋮ Lightweight merging of compressed indices based on BWT variants ⋮ Space-efficient substring occurrence estimation ⋮ Space efficient merging of de Bruijn graphs and Wheeler graphs ⋮ On the complexity of recognizing Wheeler graphs
This page was built for publication: The compressed permuterm index
