The following pages link to (Q4471381):
Displaying 50 items.
- Compressed matching for feature vectors (Q294934) (← links)
- Fast construction of wavelet trees (Q294942) (← links)
- Random access to Fibonacci encoded files (Q313776) (← links)
- Succinct posets (Q329288) (← links)
- Compressed directed acyclic word graph with application in local alignment (Q378207) (← links)
- Compact binary relation representations with rich functionality (Q386006) (← links)
- Space efficient data structures for dynamic orthogonal range counting (Q390134) (← links)
- Entropy-bounded representation of point grids (Q390358) (← 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)
- Space-efficient data-analysis queries on grids (Q390915) (← links)
- On compressing permutations and adaptive sorting (Q391981) (← links)
- Cross-document pattern matching (Q396714) (← links)
- Ultra-succinct representation of ordered trees with applications (Q414928) (← links)
- Bidirectional search in a string with wavelet trees and bidirectional matching statistics (Q418161) (← links)
- New algorithms on wavelet trees and applications to information retrieval (Q418727) (← links)
- Improved algorithms for the range next value problem and applications (Q428870) (← links)
- Compact navigation and distance oracles for graphs with small treewidth (Q472468) (← links)
- Efficient fully-compressed sequence representations (Q472482) (← links)
- Optimal indexes for sparse bit vectors (Q472491) (← 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)
- On optimally partitioning a text to improve its compression (Q634677) (← 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)
- Speeding up dynamic programming in the line-constrained \(k\)-median (Q726094) (← links)
- Dynamic rank/select structures with applications to run-length encoded texts (Q732034) (← links)
- Rank/select on dynamic compressed sequences and applications (Q732036) (← links)
- Selection from read-only memory with limited workspace (Q744087) (← links)
- Improved parallel construction of wavelet trees and rank/select structures (Q776833) (← links)
- Compact and succinct data structures for multidimensional orthogonal range searching (Q776842) (← links)
- A simple storage scheme for strings achieving entropy bounds (Q870846) (← links)
- Two-dimensional range successor in optimal time and almost linear space (Q894470) (← links)
- Succinct data structures for flexible text retrieval systems (Q924538) (← 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)
- Space-efficient indexes for forbidden extension queries (Q1632508) (← links)
- Approximate string matching with compressed indexes (Q1662494) (← links)
- Wheeler graphs: a framework for BWT-based data structures (Q1676308) (← links)
- Time-space trade-offs for Lempel-Ziv compressed indexing (Q1694685) (← links)
- Fixed block compression boosting in FM-indexes: theory and practice (Q1739099) (← links)
- Path queries on functions (Q1740690) (← links)
- On the string matching with \(k\) mismatches (Q1743717) (← links)
- Dynamic relative compression, dynamic partial sums, and substring concatenation (Q1755738) (← links)
