scientific article; zbMATH DE number 6850405
From MaRDI portal
Publication:4607985
Database theory (68P15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computing methodologies for text processing; mathematical typography (68U15) Algorithms on strings (68W32) Analysis of algorithms (68W40)
Recommendations
- Fully functional suffix trees and optimal text searching in BWT-runs bounded space
- scientific article; zbMATH DE number 7651115
- A linear lower bound on index size for text retrieval
- Linear time construction of compressed text indices in compact space
- Optimal Substring Equality Queries with Applications to Sparse Text Indexing
- Lower bounds for text indexing with mismatches and differences
- A linear lower bound on index size for text retrieval
- Geometric BWT: compressed text indexing via sparse suffixes and range searching
- Optimal prefix and suffix queries on texts
- Optimal prefix and suffix queries on texts
Cited in
(47)- Comparison of LZ77-type parsings
- A separation between RLSLPs and LZ77
- A faster implementation of online RLBWT and its application to LZ77 parsing
- Universal compressed text indexing
- Flexible indexing of repetitive collections
- Wheeler languages
- r-indexing the eBWT
- Grammar index by induced suffix sorting
- Lempel-Ziv-like parsing in small space
- A combinatorial view on string attractors
- Refining the \(r\)-index
- Document listing on repetitive collections with guaranteed performance
- Improved characters distance sampling for online and offline text searching
- Composite repetition-aware data structures
- An Opportunistic Text Indexing Structure Based on Run Length Encoding
- r-index
- Optimal-Time Dictionary-Compressed Indexes
- Conversion from RLBWT to LZ77
- A new class of searchable and provably highly compressible string transformations
- Indexing the bijective BWT
- Prefix-free parsing for building big BWTs
- Haplotype-aware graph indexes
- Fully functional suffix trees and optimal text searching in BWT-runs bounded space
- Online LZ77 parsing and matching statistics with RLBWTs
- Optimal construction of compressed indexes for highly repetitive texts
- scientific article; zbMATH DE number 7651154 (Why is no real title available?)
- Bit catastrophes for the Burrows-Wheeler transform
- Spectrum preserving tilings enable sparse and modular reference indexing
- MAGE: strain level profiling of metagenome samples
- Balancing run-length straight-line programs
- Accessing the suffix array via \(\phi^{-1}\)-forest
- Constructing and indexing the bijective and extended Burrows-Wheeler transform
- Smaller Fully-Functional Bidirectional BWT Indexes
- Adaptive succinctness
- r-indexing the eBWT
- Non-overlapping indexing in BWT-runs bounded space
- Constant time and space updates for the sigma-tau problem
- Wheeler maps
- b-move: faster bidirectional character extensions in a run-length compressed index
- Inverting parameterized Burrows-Wheeler transform
- Improved pangenomic classification accuracy with chain statistics
- Algorithms for Galois words: detection, factorization, and rotation
- Solving the minimal positional substring cover problem in sublinear space
- Non-overlapping indexing in BWT-runs bounded space
- Bit catastrophes for the Burrows-Wheeler transform
- LZ78 substring compression in compressed space
- A compressed dynamic self-index for highly repetitive text collections
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4607985)
