Pages that link to "Item:Q2944558"
From MaRDI portal
The following pages link to Compressed indexes for dynamic text collections (Q2944558):
Displaying 27 items.
- Succinct dynamic cardinal trees (Q262263) (← links)
- Succinct representation of dynamic trees (Q541673) (← links)
- Space-efficient construction of Lempel-Ziv compressed text indexes (Q549672) (← links)
- Rank/select on dynamic compressed sequences and applications (Q732036) (← links)
- A compressed dynamic self-index for highly repetitive text collections (Q776840) (← links)
- A faster algorithm for matching a set of patterns with variable length don't cares (Q991757) (← links)
- Faster entropy-bounded compressed suffix trees (Q1038474) (← links)
- Fully-online suffix tree and directed acyclic word graph construction for multiple texts (Q2309475) (← links)
- Efficient dynamic dictionary matching with DAWGs and AC-automata (Q2326393) (← links)
- Compressing dictionary matching index via sparsification technique (Q2354027) (← links)
- Succinct 2D dictionary matching (Q2392930) (← links)
- Compressed text indexing with wildcards (Q2434928) (← links)
- Wavelet trees for all (Q2442812) (← links)
- Fully functional static and dynamic succinct trees (Q2799480) (← links)
- Dynamic dictionary matching and compressed suffix trees (Q2921649) (← links)
- Fast circular dictionary-matching algorithm (Q2971059) (← links)
- Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet (Q3010401) (← links)
- Dynamic Text Indexing under String Updates (Q3128197) (← links)
- Searching and Indexing Circular Patterns (Q3305518) (← links)
- Compressed Data Structures for Dynamic Sequences (Q3452849) (← links)
- Compressed Text Indexes with Fast Locate (Q3506924) (← links)
- An Online Algorithm for Finding the Longest Previous Factors (Q3541131) (← links)
- Improved Dynamic Text Indexing (Q4242657) (← links)
- Optimal rank and select queries on dictionary-compressed text (Q5088891) (← links)
- Haplotype-aware graph indexes (Q5090328) (← links)
- Combinatorial Pattern Matching (Q5315352) (← links)
- Multi-pattern matching algorithm with wildcards based on bit-parallelism (Q5371909) (← links)
