Pages that link to "Item:Q2944557"
From MaRDI portal
The following pages link to Compressed representations of sequences and full-text indexes (Q2944557):
Displaying 50 items.
- Space-efficient substring occurrence estimation (Q261345) (← links)
- Succinct dynamic cardinal trees (Q262263) (← links)
- Compressed string dictionary search with edit distance one (Q270017) (← links)
- Automata evaluation and text search protocols with simulation-based security (Q290379) (← links)
- Fast construction of wavelet trees (Q294942) (← links)
- Approximate string matching using a bidirectional index (Q294959) (← links)
- Compressed property suffix trees (Q386003) (← links)
- Compact binary relation representations with rich functionality (Q386006) (← links)
- Space efficient data structures for dynamic orthogonal range counting (Q390134) (← links)
- Compressed indexes for text with wildcards (Q390873) (← links)
- Colored range queries and document retrieval (Q390874) (← links)
- On compressing and indexing repetitive sequences (Q390894) (← links)
- On compressing permutations and adaptive sorting (Q391981) (← links)
- Top-\(k\) document retrieval in optimal space (Q396625) (← links)
- On-line construction of position heaps (Q396632) (← links)
- Multi-pattern matching with bidirectional indexes (Q396713) (← links)
- Cross-document pattern matching (Q396714) (← links)
- Bounds from a card trick (Q414410) (← links)
- On the number of elements to reorder when updating a suffix array (Q414460) (← links)
- Bidirectional search in a string with wavelet trees and bidirectional matching statistics (Q418161) (← links)
- Approximate all-pairs suffix/prefix overlaps (Q418172) (← links)
- New algorithms on wavelet trees and applications to information retrieval (Q418727) (← links)
- Efficient fully-compressed sequence representations (Q472482) (← links)
- Tight and simple web graph compression for forward and reverse neighbor queries (Q496546) (← links)
- Tighter bounds for the sum of irreducible LCP values (Q507409) (← links)
- Combined data structure for previous- and next-smaller-values (Q533896) (← links)
- A quick tour on suffix arrays and compressed suffix arrays (Q544881) (← links)
- Space-efficient construction of Lempel-Ziv compressed text indexes (Q549672) (← links)
- Improved data structures for the orthogonal range successor problem (Q617543) (← links)
- Finding range minima in the middle: approximations and applications (Q626956) (← links)
- On approximate jumbled pattern matching in strings (Q692932) (← links)
- Succinct data structures for searchable partial sums with optimal worst-case performance (Q719256) (← links)
- Lempel-Ziv-78 compressed string dictionaries (Q724216) (← links)
- On prefix normal words and prefix normal forms (Q729994) (← links)
- A four-stage algorithm for updating a Burrows-Wheeler transform (Q732025) (← links)
- Dynamic rank/select structures with applications to run-length encoded texts (Q732034) (← links)
- Rank/select on dynamic compressed sequences and applications (Q732036) (← links)
- Computationally secure pattern matching in the presence of malicious adversaries (Q744607) (← links)
- Improved parallel construction of wavelet trees and rank/select structures (Q776833) (← links)
- Large alphabets and incompressibility (Q845735) (← links)
- Counting suffix arrays and strings (Q932319) (← links)
- Dynamic extended suffix arrays (Q972366) (← links)
- Optimal prefix and suffix queries on texts (Q975480) (← links)
- Move-to-front, distance coding, and inversion frequencies revisited (Q982665) (← links)
- On compact representations of all-pairs-shortest-path-distance matrices (Q986563) (← links)
- Wee LCP (Q991794) (← links)
- Faster entropy-bounded compressed suffix trees (Q1038474) (← links)
- Lyndon array construction during Burrows-Wheeler inversion (Q1632505) (← links)
- Approximate string matching with compressed indexes (Q1662494) (← links)
- Towards efficient positional inverted index (Q1662625) (← links)
