Pages that link to "Item:Q3192007"
From MaRDI portal
The following pages link to Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract) (Q3192007):
Displaying 32 items.
- Compressed indexes for text with wildcards (Q390873) (← links)
- On compressing and indexing repetitive sequences (Q390894) (← links)
- Succinct representations of permutations and functions (Q441860) (← links)
- Approximate string matching using compressed suffix arrays (Q818136) (← links)
- Replacing suffix trees with enhanced suffix arrays (Q876707) (← links)
- Indexing text using the Ziv--Lempel trie (Q876708) (← links)
- Text indexing with errors (Q925060) (← links)
- Improved approximate string matching using compressed suffix data structures (Q930602) (← links)
- Counting suffix arrays and strings (Q932319) (← links)
- Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays (Q1006380) (← links)
- Wheeler graphs: a framework for BWT-based data structures (Q1676308) (← links)
- Time-space trade-offs for Lempel-Ziv compressed indexing (Q1694685) (← links)
- On-line construction of compact directed acyclic word graphs (Q1764897) (← links)
- Ranked document retrieval for multiple patterns (Q1784746) (← links)
- Time-space trade-offs for compressed suffix arrays. (Q1853020) (← links)
- Distribution-aware compressed full-text indexes (Q2017875) (← 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)
- Succinct non-overlapping indexing (Q2285052) (← links)
- Improved and extended locating functionality on compressed suffix arrays (Q2343300) (← links)
- The cell probe complexity of succinct data structures (Q2373728) (← links)
- Wavelet trees for all (Q2442812) (← links)
- Compressed data structures: Dictionaries and data-aware measures (Q2465063) (← links)
- Opportunistic data structures for range queries (Q2498981) (← links)
- Constructing suffix arrays in linear time (Q2569391) (← links)
- Locally Compressed Suffix Arrays (Q2828176) (← links)
- Ranked Document Retrieval with Forbidden Pattern (Q2942247) (← links)
- Succinct Non-overlapping Indexing (Q2942256) (← links)
- Succincter Text Indexing with Wildcards (Q3011841) (← links)
- Self-indexing Based on LZ77 (Q3011842) (← links)
- Algorithms for Indexing Highly Similar DNA Sequences (Q3305514) (← links)
- (Q5111826) (← links)
