scientific article; zbMATH DE number 6850405
zbMATH Open1403.68051arXiv1705.10382MaRDI QIDQ4607985FDOQ4607985
Authors: Travis Gagie, Nicola Prezza, Gonzalo Navarro 
Publication date: 15 March 2018
Full work available at URL: https://arxiv.org/abs/1705.10382
Title of this publication is not available (Why is that?)
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
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)
Cited In (38)
- Title not available (Why is that?)
- Adaptive succinctness
- Wheeler languages
- Comparison of LZ77-type parsings
- Flexible indexing of repetitive collections
- Smaller Fully-Functional Bidirectional BWT Indexes
- Title not available (Why is that?)
- Accessing the suffix array via \(\phi^{-1}\)-forest
- A new class of searchable and provably highly compressible string transformations
- Optimal construction of compressed indexes for highly repetitive texts
- Fully functional suffix trees and optimal text searching in BWT-runs bounded space
- Online LZ77 parsing and matching statistics with RLBWTs
- A separation between RLSLPs and LZ77
- Document listing on repetitive collections with guaranteed performance
- An Opportunistic Text Indexing Structure Based on Run Length Encoding
- Grammar index by induced suffix sorting
- r-indexing the eBWT
- Bit catastrophes for the Burrows-Wheeler transform
- Lempel-Ziv-like parsing in small space
- Refining the \(r\)-index
- Spectrum preserving tilings enable sparse and modular reference indexing
- Composite repetition-aware data structures
- r-index
- Constructing and indexing the bijective and extended Burrows-Wheeler transform
- MAGE: strain level profiling of metagenome samples
- A compressed dynamic self-index for highly repetitive text collections
- Prefix-free parsing for building big BWTs
- Improved characters distance sampling for online and offline text searching
- Haplotype-aware graph indexes
- A faster implementation of online RLBWT and its application to LZ77 parsing
- Balancing run-length straight-line programs
- A combinatorial view on string attractors
- Universal compressed text indexing
- \(r\)-indexing the eBWT
- Constant time and space updates for the sigma-tau problem
- Non-overlapping indexing in BWT-runs bounded space
- Wheeler maps
- Indexing the bijective BWT
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)
