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)- Approximate string matching with compressed indexes
- Space-efficient frameworks for top-\(k\) string retrieval
- scientific article; zbMATH DE number 7378722 (Why is no real title available?)
- Self-indexed Text Compression Using Straight-Line Programs
- Alphabet-independent linear-time construction of compressed suffix arrays using \(o(n \log n)\)-bit working space
- Compressed spaced suffix arrays
- Faster suffix sorting
- Constructing and indexing the bijective and extended Burrows-Wheeler transform
- Faster repetition-aware compressed suffix trees based on block trees
- Position-Restricted Substring Searching
- Space-time trade-offs for finding shortest unique substrings and maximal unique matches
- Succinct Non-overlapping Indexing
- Distribution-aware compressed full-text indexes
- General document retrieval in compact space
- Distribution-aware compressed full-text indexes
- Prefix-free parsing for building big BWTs
- The compressed permuterm index
- Improved characters distance sampling for online and offline text searching
- Arithmetics on suffix arrays of Fibonacci words
- Space efficient merging of de Bruijn graphs and Wheeler graphs
- Geometric BWT: compressed text indexing via sparse suffixes and range searching
- A brief history of parameterized matching problems
- A resource-frugal probabilistic dictionary and applications in bioinformatics
- Parallel computation of the Burrows Wheeler transform in compact space
- The alternating BWT: an algorithmic perspective
- Time-space trade-offs for Lempel-Ziv compressed indexing
- FM-index of alignment with gaps
- Compressed text indexing with wildcards
- Wavelet trees for all
- Fast relative Lempel-Ziv self-index for similar sequences
- Haplotype-aware graph indexes
- New text indexing functionalities of the compressed suffix arrays
- A grouping approach for succinct dynamic dictionary matching
- scientific article; zbMATH DE number 2080264 (Why is no real title available?)
- Compressed directed acyclic word graph with application in local alignment
- Dynamic relative compression, dynamic partial sums, and substring concatenation
- Universal compressed text indexing
- Fixed block compression boosting in FM-indexes: theory and practice
- On position restricted substring searching in succinct space
- Time-space trade-offs for Lempel-Ziv compressed indexing
- The ring: worst-case optimal joins in graph databases using (almost) no extra space
- Dictionary matching with a bounded gap in pattern or in text
- Hybrid indexes for repetitive datasets
- Efficient online string matching based on characters distance text sampling
- \(r\)-indexing the eBWT
- Constant time and space updates for the sigma-tau problem
- Non-overlapping indexing in BWT-runs bounded space
- Wheeler maps
- CUSHAW suite: parallel and efficient algorithms for NGS read alignment
- Lazy Lempel-Ziv factorization algorithms
- 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
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)
