Pages that link to "Item:Q1038474"
From MaRDI portal
The following pages link to Faster entropy-bounded compressed suffix trees (Q1038474):
Displayed 25 items.
- Compressed indexes for text with wildcards (Q390873) (← links)
- On compressing and indexing repetitive sequences (Q390894) (← links)
- Multi-pattern matching with bidirectional indexes (Q396713) (← links)
- Cross-document pattern matching (Q396714) (← links)
- Combined data structure for previous- and next-smaller-values (Q533896) (← links)
- Wee LCP (Q991794) (← links)
- Encoding nearest larger values (Q1698712) (← links)
- Practical compressed suffix trees (Q1736557) (← links)
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations (Q1758161) (← links)
- Improved and extended locating functionality on compressed suffix arrays (Q2343300) (← links)
- Succinct 2D dictionary matching (Q2392930) (← links)
- Improved range minimum queries (Q2397152) (← links)
- Speeding up the detection of tandem repeats over the edit distance (Q2437752) (← links)
- Space efficient data structures for nearest larger neighbor (Q2634717) (← links)
- Faster repetition-aware compressed suffix trees based on block trees (Q2672222) (← links)
- Locally Compressed Suffix Arrays (Q2828176) (← links)
- Encoding Nearest Larger Values (Q2942276) (← links)
- Space Efficient Data Structures for Nearest Larger Neighbor (Q2946053) (← links)
- The longest common substring problem (Q2971067) (← links)
- Succincter Text Indexing with Wildcards (Q3011841) (← links)
- LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations (Q3011862) (← links)
- Faster Compressed Suffix Trees for Repetitive Collections (Q5266617) (← links)
- Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies (Q5270943) (← links)
- Practical Performance of Space Efficient Data Structures for Longest Common Extensions. (Q5874509) (← links)
- Balancing run-length straight-line programs (Q6111582) (← links)