Alphabet-Independent Compressed Text Indexing
From MaRDI portal
Publication:3092277
DOI10.1007/978-3-642-23719-5_63zbMath1325.68307OpenAlexW2283054559MaRDI QIDQ3092277
Djamal Belazzougui, Gonzalo Navarro
Publication date: 16 September 2011
Published in: Algorithms – ESA 2011 (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/147721
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05) Algorithms on strings (68W32)
Related Items
Top-\(k\) term-proximity in succinct space, Compressed spaced suffix arrays, Document retrieval with one wildcard, On position restricted substring searching in succinct space, Compressed property suffix trees, A framework for space-efficient string kernels, Compressed indexes for text with wildcards, Top-\(k\) document retrieval in optimal space, Time-Optimal Top-$k$ Document Retrieval, Wavelet trees for all, Efficient fully-compressed sequence representations, Improved space-time tradeoffs for approximate full-text indexing with one edit error, Succinct indexes for reporting discriminating and generic words, Spaces, Trees, and Colors, New space/time tradeoffs for top-\(k\) document retrieval on sequences, Distribution-aware compressed full-text indexes, Ranked document retrieval for multiple patterns, Locally Compressed Suffix Arrays, From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures, Unnamed Item, Improved and extended locating functionality on compressed suffix arrays, Structural Pattern Matching - Succinctly., Fast Compressed Self-Indexes with Deterministic Linear-Time Construction