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)- The compressed permuterm index
- A simpler analysis of Burrows-Wheeler-based compression
- Succinct Non-overlapping Indexing
- Ultra-succinct representation of ordered trees with applications
- Compressed string dictionary search with edit distance one
- Parallel algorithms for Burrows-Wheeler compression and decompression
- Time-space trade-offs for Lempel-Ziv compressed indexing
- Compressed text indexing with wildcards
- Space-time trade-offs for finding shortest unique substrings and maximal unique matches
- Lightweight algorithms for constructing and inverting the BWT of string collections
- Space-efficient construction of Lempel-Ziv compressed text indexes
- scientific article; zbMATH DE number 2080264 (Why is no real title available?)
- Wavelet trees for all
- Fast relative Lempel-Ziv self-index for similar sequences
- Stronger Lempel-Ziv based compressed text indexing
- Dynamic relative compression, dynamic partial sums, and substring concatenation
- Practical compact indexes for top-\(k\) document retrieval
- Succinct data structures for searchable partial sums with optimal worst-case performance
- Self-indexing based on LZ77
- Lightweight BWT construction for very large string collections
- Wee LCP
- Universal compressed text indexing
- Self-indexed Text Compression Using Straight-Line Programs
- Approximate all-pairs suffix/prefix overlaps
- Geometric BWT: compressed text indexing via sparse suffixes and range searching
- Fixed block compression boosting in FM-indexes: theory and practice
- Compression and Ranking
- Orthogonal range searching for text indexing
- Indexes for document retrieval with relevance
- Multi-pattern matching with bidirectional indexes
- Optimal indexes for sparse bit vectors
- A quick tour on suffix arrays and compressed suffix arrays
- A simple storage scheme for strings achieving entropy bounds
- Compressed string-matching in standard Sturmian words
- Succinct non-overlapping indexing
- Online LZ77 parsing and matching statistics with RLBWTs
- Rank and select revisited and extended
- Wheeler graphs: a framework for BWT-based data structures
- Compressed directed acyclic word graph with application in local alignment
- A simple storage scheme for strings achieving entropy bounds
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
- Hybrid indexes for repetitive datasets
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Space-efficient frameworks for top-\(k\) string retrieval
- Linked dynamic tries with applications to LZ-compression in sublinear time and space
- Indexed multi-pattern matching
- Compression, indexing, and retrieval for massive string data
- Compressed property suffix trees
- Locally compressed suffix arrays
- New text indexing functionalities of the compressed suffix arrays
- Efficient fully-compressed sequence representations
- On undetected redundancy in the Burrows-Wheeler transform
- On compressing and indexing repetitive sequences
- Lazy Lempel-Ziv factorization algorithms
- Lempel-Ziv factorization powered by space efficient suffix trees
- Alphabet-independent linear-time construction of compressed suffix arrays using \(o(n \log n)\)-bit working space
- Computing the Burrows-Wheeler transform in place and in small space
- Succinct data structures for flexible text retrieval systems
- Position-Restricted Substring Searching
- Approximate string matching with compressed indexes
- Compressed indexing with signature grammars
- Improved space-time tradeoffs for approximate full-text indexing with one edit error
- New algorithms on wavelet trees and applications to information retrieval
- Compressing dictionary matching index via sparsification technique
- An experimental study of a compressed index
- Space-efficient substring occurrence estimation
- Faster suffix sorting
- A grouping approach for succinct dynamic dictionary matching
- CUSHAW suite: parallel and efficient algorithms for NGS read alignment
- FM-index of alignment: a compressed index for similar strings
- On the complexity of recognizing Wheeler graphs
- A new class of string transformations for compressed text indexing
- Composite repetition-aware data structures
- scientific article; zbMATH DE number 7559194 (Why is no real title available?)
- Fast BWT in small space by blockwise suffix sorting
- String Indexing with Compressed Patterns
- Analysis of min-hashing for variant tolerant DNA read mapping
- Indexing a sequence for mapping reads with a single mismatch
- \(r\)-indexing the eBWT
- Constant time and space updates for the sigma-tau problem
- Non-overlapping indexing in BWT-runs bounded space
- Fast Compressed Self-Indexes with Deterministic Linear-Time Construction
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
- Wheeler maps
- Constructing and indexing the bijective and extended Burrows-Wheeler transform
- String search experimentation using massive data
- Succinct oblivious RAM
- The ring: worst-case optimal joins in graph databases using (almost) no extra space
- Full-text indexes for high-throughput sequencing
- Kings, name days, lazy servants and magic
- Practical Wavelet Tree Construction
- Improved characters distance sampling for online and offline text searching
- A succinct solution to Rmap alignment
- LZ78 compression in low main memory space
- Lossless seeds for searching short patterns with high error rates
- Faster repetition-aware compressed suffix trees based on block trees
- Arithmetics on suffix arrays of Fibonacci words
- Approximate search of short patterns with high error rates using the \(01^\ast 0\) lossless seeds
- Engineering practical Lempel-Ziv tries
- Grammar compressed sequences with rank/select support
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)
