Pages that link to "Item:Q3654373"
From MaRDI portal
The following pages link to Breaking a Time-and-Space Barrier in Constructing Full-Text Indices (Q3654373):
Displaying 16 items.
- On compressing and indexing repetitive sequences (Q390894) (← links)
- A grouping approach for succinct dynamic dictionary matching (Q513298) (← links)
- Space-efficient construction of Lempel-Ziv compressed text indexes (Q549672) (← links)
- Approximate string matching using compressed suffix arrays (Q818136) (← links)
- Suffix-sorting via Shannon-Fano-Elias codes (Q1662548) (← links)
- Fragmented BWT: an extended BWT for full-text indexing (Q1796834) (← links)
- Space-efficient construction of compressed suffix trees (Q2220837) (← links)
- Parallel computation of the Burrows Wheeler transform in compact space (Q2297855) (← links)
- Computing the Burrows-Wheeler transform in place and in small space (Q2343299) (← links)
- Space-time trade-offs for finding shortest unique substrings and maximal unique matches (Q2410365) (← links)
- Lightweight data indexing and compression in external memory (Q2429367) (← links)
- Fast BWT in small space by blockwise suffix sorting (Q2465056) (← links)
- Fully functional static and dynamic succinct trees (Q2799480) (← links)
- A high-speed dynamic full-text search method by using memory management (Q4652853) (← links)
- Forty Years of Text Indexing (Q4928554) (← links)
- Engineering a Distributed Full-Text Index (Q5232570) (← links)