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.
- Wheeler graphs: a framework for BWT-based data structures (Q1676308) (← links)
- Time-space trade-offs for Lempel-Ziv compressed indexing (Q1694685) (← links)
- Practical compressed suffix trees (Q1736557) (← links)
- Fixed block compression boosting in FM-indexes: theory and practice (Q1739099) (← links)
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations (Q1758161) (← links)
- Ranked document retrieval for multiple patterns (Q1784746) (← links)
- Fast compressed self-indexes with deterministic linear-time construction (Q1986963) (← links)
- New space/time tradeoffs for top-\(k\) document retrieval on sequences (Q2015136) (← links)
- Distribution-aware compressed full-text indexes (Q2017875) (← links)
- Range majorities and minorities in arrays (Q2032347) (← links)
- The exact multiple pattern matching problem solved by a reference tree approach (Q2044955) (← links)
- Top tree compression of tries (Q2067669) (← links)
- Faster online computation of the succinct longest previous factor array (Q2106621) (← links)
- Space efficient merging of de Bruijn graphs and Wheeler graphs (Q2118200) (← links)
- Practical space-efficient index for structural pattern matching (Q2169971) (← links)
- Using compressed suffix-arrays for a compact representation of temporal-graphs (Q2200556) (← links)
- A framework for designing space-efficient dictionaries for parameterized and order-preserving matching (Q2220859) (← links)
- Lempel-Ziv compressed structures for document retrieval (Q2272976) (← links)
- Lightweight merging of compressed indices based on BWT variants (Q2297864) (← links)
- Sliding suffix tree (Q2331636) (← links)
- Improved and extended locating functionality on compressed suffix arrays (Q2343300) (← links)
- Bottom-\(k\) document retrieval (Q2343302) (← links)
- Geometric BWT: compressed text indexing via sparse suffixes and range searching (Q2346957) (← links)
- Top-\(k\) term-proximity in succinct space (Q2362352) (← links)
- Succinct indices for path minimum, with applications (Q2362355) (← links)
- Engineering a lightweight external memory suffix array construction algorithm (Q2363989) (← links)
- Faster average case low memory semi-external construction of the Burrows-Wheeler transform (Q2363991) (← links)
- On position restricted substring searching in succinct space (Q2376796) (← links)
- The myriad virtues of wavelet trees (Q2389347) (← links)
- Grammar compressed sequences with rank/select support (Q2397151) (← links)
- Algorithms to compute the Burrows-Wheeler similarity distribution (Q2420649) (← links)
- Stronger Lempel-Ziv based compressed text indexing (Q2428663) (← links)
- Lightweight data indexing and compression in external memory (Q2429367) (← links)
- Compressed text indexing with wildcards (Q2434928) (← links)
- Wavelet trees for all (Q2442812) (← links)
- On the combinatorics of suffix arrays (Q2445335) (← links)
- Fast relative Lempel-Ziv self-index for similar sequences (Q2445867) (← links)
- Faster semi-external suffix sorting (Q2445902) (← links)
- From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization (Q2465055) (← links)
- Fast BWT in small space by blockwise suffix sorting (Q2465056) (← links)
- Rank and select revisited and extended (Q2465064) (← links)
- The affix array data structure and its applications to RNA secondary structure analysis (Q2465645) (← links)
- Approximate search of short patterns with high error rates using the \(01^\ast 0\) lossless seeds (Q2628801) (← links)
- Grammar-compressed indexes with logarithmic search time (Q2656171) (← links)
- Faster repetition-aware compressed suffix trees based on block trees (Q2672222) (← links)
- Fully Functional Static and Dynamic Succinct Trees (Q2799480) (← links)
- Locally Compressed Suffix Arrays (Q2828176) (← links)
- General Document Retrieval in Compact Space (Q2828189) (← links)
- Random Access to High-Order Entropy Compressed Text (Q2848976) (← links)
- Succinct and Implicit Data Structures for Computational Geometry (Q2848977) (← links)