Pages that link to "Item:Q3799643"
From MaRDI portal
The following pages link to Efficient randomized pattern-matching algorithms (Q3799643):
Displaying 46 items.
- Access, Rank, and Select in Grammar-compressed Strings (Q3452777) (← links)
- Dictionary Matching in a Stream (Q3452800) (← links)
- Approximating LZ77 via Small-Space Multiple-Pattern Matching (Q3452816) (← links)
- An artificial neural network based approach for online string matching/filtering of large databases (Q3563649) (← links)
- LCS Approximation via Embedding into Local Non-repetitive Strings (Q3637107) (← links)
- Fast Searching in Packed Strings (Q3637108) (← links)
- A New String Matching Algorithm (Q4449514) (← links)
- Complexity of Matching Sets of Two-Dimensional Patterns by Two-Dimensional On-Line Tessellation Automaton (Q4605517) (← links)
- Streaming periodicity with mismatches (Q5002646) (← links)
- Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams (Q5002743) (← links)
- (Q5005170) (← links)
- (Q5009608) (← links)
- Fast algorithms for two dimensional and multiple pattern matching (Q5056115) (← links)
- Dynamic algorithms for the Dyck languages (Q5057425) (← links)
- Repetition Detection in a Dynamic String (Q5075738) (← links)
- Streaming Dictionary Matching with Mismatches (Q5088912) (← links)
- Quasi-Periodicity in Streams (Q5088913) (← links)
- Searching Long Repeats in Streams (Q5088923) (← links)
- Engineering Practical Lempel-Ziv Tries (Q5102060) (← links)
- Filtering Multi-set Tree: Data Structure for Flexible Matching Using Multi-track Data (Q5135244) (← links)
- (Q5136323) (← links)
- On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation (Q5150918) (← links)
- Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries (Q5150931) (← links)
- Bouma2 – A High-Performance Input-Aware Multiple String-Match Algorithm (Q5200052) (← links)
- (Q5208665) (← links)
- A Bit-Parallel Exact String Matching Algorithm for Small Alphabet (Q5321726) (← links)
- Parallel String Matching (Q5862565) (← links)
- Practical Performance of Space Efficient Data Structures for Longest Common Extensions. (Q5874509) (← links)
- Periodicity in data streams with wildcards (Q5915573) (← links)
- A randomized algorithm for approximate string matching (Q5930159) (← links)
- Data compression with long repeated strings (Q5944433) (← links)
- Compression in the presence of shared data (Q5944435) (← links)
- Efficient construction of the BWT for repetitive text using string compression (Q6077847) (← links)
- (Q6084405) (← links)
- Classical and quantum algorithms for constructing text from dictionary problem (Q6095516) (← links)
- On using q-gram locations in approximate string matching (Q6102311) (← links)
- Near-optimal search time in \(\delta \)-optimal space, and vice versa (Q6130318) (← links)
- Near-optimal quantum algorithms for string problems (Q6174814) (← links)
- Online algorithms on antipowers and antiperiods (Q6536254) (← links)
- Searching runs in streams (Q6536256) (← links)
- A simple grammar-based index for finding approximately longest common substrings (Q6545431) (← links)
- Bounds for \(c\)-ideal hashing (Q6546593) (← links)
- Space-efficient conversions from SLPs (Q6547925) (← links)
- Sparse suffix and LCP array: simple, direct, small, and fast (Q6547927) (← links)
- Suffix arrays for multiple strings: a method for on-line multiple string searches (Q6560350) (← links)
- Internal pattern matching queries in a text and applications (Q6621750) (← links)
