Pages that link to "Item:Q1893741"
From MaRDI portal
The following pages link to Improved dynamic dictionary matching (Q1893741):
Displaying 34 items.
- A grouping approach for succinct dynamic dictionary matching (Q513298) (← links)
- On suffix extensions in suffix trees (Q714837) (← links)
- Lempel-Ziv factorization powered by space efficient suffix trees (Q724218) (← links)
- A faster algorithm for matching a set of patterns with variable length don't cares (Q991757) (← links)
- On updating suffix tree labels (Q1129015) (← links)
- Dynamic dictionary matching in external memory (Q1275745) (← links)
- Position-restricted substring searching over small alphabets (Q1679612) (← links)
- Dictionary matching with a bounded gap in pattern or in text (Q1709592) (← links)
- Dynamic nested brackets (Q1882928) (← links)
- Internal dictionary matching (Q2037109) (← links)
- The matroid cup game (Q2060559) (← links)
- A comparative study of dictionary matching with gaps: limitations, techniques and challenges (Q2118199) (← links)
- Position heaps for Cartesian-tree matching on strings and tries (Q2146147) (← links)
- Online parameterized dictionary matching with one gap (Q2207509) (← links)
- Online recognition of dictionary with one gap (Q2216131) (← links)
- Parameterized dictionary matching and recognition with one gap (Q2220853) (← links)
- Efficient dynamic dictionary matching with DAWGs and AC-automata (Q2326393) (← links)
- Dictionary matching with a few gaps (Q2346375) (← links)
- Constructing LZ78 tries and position heaps in linear time for large alphabets (Q2346553) (← links)
- Compressing dictionary matching index via sparsification technique (Q2354027) (← links)
- Mind the gap! (Q2414857) (← links)
- Lempel Ziv Computation in Small Space (LZ-CISS) (Q2942255) (← links)
- LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding (Q2942259) (← links)
- Dictionary Matching with Uneven Gaps (Q2942261) (← links)
- Time-Optimal Top-$k$ Document Retrieval (Q2963583) (← links)
- Repetition Detection in a Dynamic String (Q5075738) (← links)
- Pattern matching in hypertext (Q5096935) (← links)
- The Online House Numbering Problem: Min-Max Online List Labeling (Q5111720) (← links)
- PARENT QUERIES OVER DYNAMIC BALANCED PARENTHESIS STRINGS (Q5168423) (← links)
- Fast prefix matching of bounded strings (Q5463440) (← links)
- Algorithms and Data Structures (Q5900766) (← links)
- On-line construction of two-dimensional suffix trees (Q5906373) (← links)
- (Q6065473) (← links)
- Two-dimensional dynamic dictionary matching (Q6487428) (← links)
