scientific article; zbMATH DE number 6850405
From MaRDI portal
Publication:4607985
Analysis of algorithms (68W40) Database theory (68P15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32) Computing methodologies for text processing; mathematical typography (68U15)
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
(38)- A combinatorial view on string attractors
- Accessing the suffix array via \(\phi^{-1}\)-forest
- Haplotype-aware graph indexes
- A compressed dynamic self-index for highly repetitive text collections
- A new class of searchable and provably highly compressible string transformations
- Refining the \(r\)-index
- \(r\)-indexing the eBWT
- A faster implementation of online RLBWT and its application to LZ77 parsing
- Constant time and space updates for the sigma-tau problem
- Non-overlapping indexing in BWT-runs bounded space
- Universal compressed text indexing
- Wheeler maps
- Optimal construction of compressed indexes for highly repetitive texts
- Constructing and indexing the bijective and extended Burrows-Wheeler transform
- An Opportunistic Text Indexing Structure Based on Run Length Encoding
- Lempel-Ziv-like parsing in small space
- Fully functional suffix trees and optimal text searching in BWT-runs bounded space
- MAGE: strain level profiling of metagenome samples
- Comparison of LZ77-type parsings
- Online LZ77 parsing and matching statistics with RLBWTs
- scientific article; zbMATH DE number 7559177 (Why is no real title available?)
- r-index
- Prefix-free parsing for building big BWTs
- Document listing on repetitive collections with guaranteed performance
- Adaptive succinctness
- Improved characters distance sampling for online and offline text searching
- Balancing run-length straight-line programs
- Wheeler languages
- Smaller Fully-Functional Bidirectional BWT Indexes
- Flexible indexing of repetitive collections
- Grammar index by induced suffix sorting
- r-indexing the eBWT
- Composite repetition-aware data structures
- scientific article; zbMATH DE number 7651154 (Why is no real title available?)
- Bit catastrophes for the Burrows-Wheeler transform
- Indexing the bijective BWT
- Spectrum preserving tilings enable sparse and modular reference indexing
- A separation between RLSLPs and LZ77
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)
