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)- Extended suffix array construction using Lyndon factors
- Lyndon array construction during Burrows-Wheeler inversion
- Approximate string matching with compressed indexes
- Wheeler graphs: a framework for BWT-based data structures
- Time-space trade-offs for Lempel-Ziv compressed indexing
- FM-index of alignment with gaps
- Dictionary matching with a bounded gap in pattern or in text
- Universal compressed text indexing
- Fixed block compression boosting in FM-indexes: theory and practice
- Dynamic relative compression, dynamic partial sums, and substring concatenation
- Ranked document retrieval for multiple patterns
- Fast compressed self-indexes with deterministic linear-time construction
- Computing the multi-string BWT and LCP array in external memory
- Flexible indexing of repetitive collections
- Distribution-aware compressed full-text indexes
- Wheeler languages
- Space efficient merging of de Bruijn graphs and Wheeler graphs
- On the complexity of recognizing Wheeler graphs
- The heaviest induced ancestors problem: better data structures and applications
- Logarithmic equal-letter runs for BWT of purely morphic words
- Efficient online string matching based on characters distance text sampling
- A framework for designing space-efficient dictionaries for parameterized and order-preserving matching
- Compressed string-matching in standard Sturmian words
- Lempel-Ziv compressed structures for document retrieval
- Succinct non-overlapping indexing
- Compressed indexing with signature grammars
- A resource-frugal probabilistic dictionary and applications in bioinformatics
- A brief history of parameterized matching problems
- Refining the \(r\)-index
- Parallel computation of the Burrows Wheeler transform in compact space
- Lightweight merging of compressed indices based on BWT variants
- The alternating BWT: an algorithmic perspective
- Computing the Burrows-Wheeler transform in place and in small space
- Improved and extended locating functionality on compressed suffix arrays
- Geometric BWT: compressed text indexing via sparse suffixes and range searching
- Linked dynamic tries with applications to LZ-compression in sublinear time and space
- Compressing dictionary matching index via sparsification technique
- An external-memory algorithm for string graph construction
- Engineering a lightweight external memory suffix array construction algorithm
- Compressed spaced suffix arrays
- On position restricted substring searching in succinct space
- Grammar compressed sequences with rank/select support
- Space-time trade-offs for finding shortest unique substrings and maximal unique matches
- Algorithms to compute the Burrows-Wheeler similarity distribution
- Stronger Lempel-Ziv based compressed text indexing
- Compressed text indexing with wildcards
- Parallel algorithms for Burrows-Wheeler compression and decompression
- Wavelet trees for all
- Fast relative Lempel-Ziv self-index for similar sequences
- Alphabet-independent linear-time construction of compressed suffix arrays using \(o(n \log n)\)-bit working space
- A simpler analysis of Burrows-Wheeler-based compression
- Fast BWT in small space by blockwise suffix sorting
- Faster suffix sorting
- Rank and select revisited and extended
- Space-efficient substring occurrence estimation
- Approximate search of short patterns with high error rates using the 01^ 0 lossless seeds
- Grammar-compressed indexes with logarithmic search time
- Faster repetition-aware compressed suffix trees based on block trees
- Edge minimization in de Bruijn graphs
- Improved characters distance sampling for online and offline text searching
- Compressed string dictionary search with edit distance one
- Locally compressed suffix arrays
- General document retrieval in compact space
- Orthogonal range searching for text indexing
- Indexes for document retrieval with relevance
- Indexed multi-pattern matching
- A simple storage scheme for strings achieving entropy bounds
- Composite repetition-aware data structures
- Succinct Non-overlapping Indexing
- Dictionary matching with uneven gaps
- Compressed representations of sequences and full-text indexes
- Lossless seeds for searching short patterns with high error rates
- FM-index of alignment: a compressed index for similar strings
- String search experimentation using massive data
- Hybrid indexes for repetitive datasets
- Indexing a sequence for mapping reads with a single mismatch
- Self-indexing based on LZ77
- Lightweight BWT construction for very large string collections
- Distribution-aware compressed full-text indexes
- Self-indexed Text Compression Using Straight-Line Programs
- The compressed permuterm index
- Space-efficient frameworks for top-k string retrieval
- Succinct oblivious RAM
- Algorithms for indexing highly similar DNA sequences
- Full-text indexes for high-throughput sequencing
- CUSHAW suite: parallel and efficient algorithms for NGS read alignment
- Kings, name days, lazy servants and magic
- Arithmetics on suffix arrays of Fibonacci words
- Position-Restricted Substring Searching
- Compression, indexing, and retrieval for massive string data
- Compressed directed acyclic word graph with application in local alignment
- Compressed property suffix trees
- On compressing and indexing repetitive sequences
- Lightweight algorithms for constructing and inverting the BWT of string collections
- Multi-pattern matching with bidirectional indexes
- Compression and Ranking
- Ultra-succinct representation of ordered trees with applications
- Approximate all-pairs suffix/prefix overlaps
- New algorithms on wavelet trees and applications to information retrieval
- A linear lower bound on index size for text retrieval
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)
