Pages that link to "Item:Q2944557"
From MaRDI portal
The following pages link to Compressed representations of sequences and full-text indexes (Q2944557):
Displaying 49 items.
- Orthogonal Range Searching for Text Indexing (Q2848980) (← links)
- Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts (Q2891377) (← links)
- Succinct Non-overlapping Indexing (Q2942256) (← links)
- Lossless Seeds for Searching Short Patterns with High Error Rates (Q2946072) (← links)
- Time-Optimal Top-$k$ Document Retrieval (Q2963583) (← links)
- The longest common substring problem (Q2971067) (← links)
- Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet (Q3010401) (← links)
- Succincter Text Indexing with Wildcards (Q3011841) (← links)
- Self-indexing Based on LZ77 (Q3011842) (← links)
- Counting Colours in Compressed Strings (Q3011854) (← links)
- LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations (Q3011862) (← links)
- Self-indexed Text Compression Using Straight-Line Programs (Q3182928) (← links)
- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing (Q3183444) (← links)
- Space-Efficient Frameworks for Top- <i>k</i> String Retrieval (Q3189644) (← links)
- (Q3304151) (← links)
- Algorithms for Indexing Highly Similar DNA Sequences (Q3305514) (← links)
- Full-Text Indexes for High-Throughput Sequencing (Q3305517) (← links)
- Access, Rank, and Select in Grammar-compressed Strings (Q3452777) (← links)
- Compressed Data Structures for Dynamic Sequences (Q3452849) (← links)
- An Online Algorithm for Finding the Longest Previous Factors (Q3541131) (← links)
- On the Value of Multiple Read/Write Streams for Data Compression (Q3637105) (← links)
- Permuted Longest-Common-Prefix Array (Q3637112) (← links)
- Better External Memory LCP Array Construction (Q4629538) (← links)
- (Q5088899) (← links)
- A new class of searchable and provably highly compressible string transformations (Q5088900) (← links)
- Compressed Multiple Pattern Matching (Q5088902) (← links)
- Indexing the bijective BWT (Q5088907) (← links)
- (Q5088917) (← links)
- (Q5090335) (← links)
- LZ-End Parsing in Linear Time (Q5111742) (← links)
- Structural Pattern Matching - Succinctly. (Q5136254) (← links)
- Fast Compressed Self-Indexes with Deterministic Linear-Time Construction (Q5136278) (← links)
- Lightweight BWT and LCP Merging via the Gap Algorithm (Q5150930) (← links)
- Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression (Q5150942) (← links)
- Lazy Lempel-Ziv Factorization Algorithms (Q5266607) (← links)
- LCP Array Construction in External Memory (Q5266615) (← links)
- Faster Compressed Suffix Trees for Repetitive Collections (Q5266617) (← links)
- Practical Compact Indexes for Top-<i>k</i>Document Retrieval (Q5270942) (← links)
- Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies (Q5270943) (← links)
- Efficient Data Structures for the Orthogonal Range Successor Problem (Q5323054) (← links)
- Bidirectional Variable-Order de Bruijn Graphs (Q5384620) (← links)
- SpliceTAPyR — An Efficient Method for Transcriptome Alignment (Q5384621) (← links)
- (Q5743458) (← links)
- Space efficient algorithms for the Burrows-Wheeler backtransformation (Q5961973) (← links)
- Compact representations of spatial hierarchical structures with support for topological queries (Q6040665) (← links)
- A new class of string transformations for compressed text indexing (Q6053405) (← links)
- (Q6065455) (← links)
- String Indexing with Compressed Patterns (Q6075857) (← links)
- Random access in persistent strings and segment selection (Q6174650) (← links)