Indexing compressed text
From MaRDI portal
Publication:3546296
Recommendations
- New text indexing functionalities of the compressed suffix arrays
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- scientific article; zbMATH DE number 2079421
- Practical approaches to reduce the space requirement of Lempel-Ziv-based compressed text indices
Cited in
(only showing first 100 items - show all)- Lightweight algorithms for constructing and inverting the BWT of string collections
- Optimal indexes for sparse bit vectors
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
- Fast compressed self-indexes with deterministic linear-time construction
- Indexing the bijective BWT
- A new class of string transformations for compressed text indexing
- Succinct oblivious RAM
- Compressed indexing with signature grammars
- Full-text indexes for high-throughput sequencing
- Kings, name days, lazy servants and magic
- Compression and Ranking
- Multi-pattern matching with bidirectional indexes
- On undetected redundancy in the Burrows-Wheeler transform
- Space-efficient substring occurrence estimation
- Parallel algorithms for Burrows-Wheeler compression and decompression
- Ultra-succinct representation of ordered trees with applications
- Lossless seeds for searching short patterns with high error rates
- Edge minimization in de Bruijn graphs
- The Burrows-Wheeler transform between data compression and combinatorics on words
- A framework for designing space-efficient dictionaries for parameterized and order-preserving matching
- Compressed string dictionary search with edit distance one
- Space-efficient construction of Lempel-Ziv compressed text indexes
- Computing the multi-string BWT and LCP array in external memory
- Dictionary matching with uneven gaps
- A quick tour on suffix arrays and compressed suffix arrays
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Practical Wavelet Tree Construction
- Fast entropy-bounded string dictionary look-up with mismatches
- Compressed string-matching in standard Sturmian words
- scientific article; zbMATH DE number 7559194 (Why is no real title available?)
- Approximate all-pairs suffix/prefix overlaps
- Succinct data structures for searchable partial sums with optimal worst-case performance
- Grammar compressed sequences with rank/select support
- Efficient fully-compressed sequence representations
- Improved space-time tradeoffs for approximate full-text indexing with one edit error
- Wheeler languages
- Structural Pattern Matching - Succinctly.
- Compression, indexing, and retrieval for massive string data
- scientific article; zbMATH DE number 7559174 (Why is no real title available?)
- Lightweight merging of compressed indices based on BWT variants
- Flexible indexing of repetitive collections
- An external-memory algorithm for string graph construction
- Wheeler graphs: a framework for BWT-based data structures
- Extended suffix array construction using Lyndon factors
- Improved and extended locating functionality on compressed suffix arrays
- Engineering a lightweight external memory suffix array construction algorithm
- A simple storage scheme for strings achieving entropy bounds
- Computing the Burrows-Wheeler transform in place and in small space
- Compressing dictionary matching index via sparsification technique
- Approximate search of short patterns with high error rates using the \(01^\ast 0\) lossless seeds
- A linear lower bound on index size for text retrieval
- Lempel-Ziv factorization powered by space efficient suffix trees
- Self-indexing based on LZ77
- Lightweight BWT construction for very large string collections
- FM-index of alignment: a compressed index for similar strings
- A new class of searchable and provably highly compressible string transformations
- Computational graph pangenomics: a tutorial on data structures and their applications
- Algorithms for indexing highly similar DNA sequences
- Lyndon array construction during Burrows-Wheeler inversion
- Online LZ77 parsing and matching statistics with RLBWTs
- Compressed property suffix trees
- On compressing and indexing repetitive sequences
- New algorithms on wavelet trees and applications to information retrieval
- An experimental study of a compressed index
- Algorithms to compute the Burrows-Wheeler similarity distribution
- Indexed multi-pattern matching
- On the complexity of recognizing Wheeler graphs
- Bidirectional Variable-Order de Bruijn Graphs
- A simple storage scheme for strings achieving entropy bounds
- Practical compact indexes for top-\(k\) document retrieval
- Succinct data structures for flexible text retrieval systems
- The heaviest induced ancestors problem revisited
- Fast Compressed Self-Indexes with Deterministic Linear-Time Construction
- A succinct solution to Rmap alignment
- Rank and select revisited and extended
- Locally compressed suffix arrays
- The heaviest induced ancestors problem: better data structures and applications
- Indexing a sequence for mapping reads with a single mismatch
- Wee LCP
- Fast BWT in small space by blockwise suffix sorting
- Refining the \(r\)-index
- On the Hardness and Inapproximability of Recognizing Wheeler Graphs
- String search experimentation using massive data
- Ranked document retrieval for multiple patterns
- Forty Years of Text Indexing
- LZ78 compression in low main memory space
- Engineering practical Lempel-Ziv tries
- Succinct non-overlapping indexing
- Linked dynamic tries with applications to LZ-compression in sublinear time and space
- String Indexing with Compressed Patterns
- Composite repetition-aware data structures
- Logarithmic equal-letter runs for BWT of purely morphic words
- Stronger Lempel-Ziv based compressed text indexing
- Lempel-Ziv compressed structures for document retrieval
- Analysis of min-hashing for variant tolerant DNA read mapping
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
- Grammar-compressed indexes with logarithmic search time
- A simpler analysis of Burrows-Wheeler-based compression
- Orthogonal range searching for text indexing
- Indexes for document retrieval with relevance
This page was built for publication: Indexing compressed text
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546296)
