Pages that link to "Item:Q2875102"
From MaRDI portal
The following pages link to The exact online string matching problem (Q2875102):
Displaying 28 items.
- Fast and flexible packed string matching (Q405577) (← links)
- Improved and self-tuned occurrence heuristics (Q405578) (← links)
- Designing optimal- and fast-on-average pattern matching algorithms (Q511153) (← links)
- Faster string matching based on hashing and bit-parallelism (Q522976) (← links)
- Optimal pattern matching algorithms (Q1734696) (← links)
- A faster quick search algorithm (Q1736618) (← links)
- Verifiable pattern matching on outsourced texts (Q1757465) (← links)
- Improved pattern-scan-order algorithms for string matching (Q1784983) (← links)
- Efficient string matching based on a two-step simulation of the suffix automaton (Q2117677) (← links)
- The Range Automaton: an efficient approach to text-searching (Q2140462) (← links)
- On modification of Boyer-Moore-Horspool's algorithm for tree pattern matching in linearised trees (Q2182712) (← links)
- Efficient online string matching based on characters distance text sampling (Q2205639) (← links)
- Fast string matching for DNA sequences (Q2297856) (← links)
- On-line string matching in highly similar DNA sequences (Q2363986) (← links)
- Weighted approximate parameterized string matching (Q2409763) (← links)
- Towards optimal packed string matching (Q2437754) (← links)
- A weak approach to suffix automata simulation for exact and approximate string matching (Q2676468) (← links)
- Improved characters distance sampling for online and offline text searching (Q2682926) (← links)
- Compact suffix automata representations for searching long patterns (Q2699978) (← links)
- Verifiable Pattern Matching on Outsourced Texts (Q2827727) (← links)
- A Very Fast String Matching Algorithm Based on Condensed Alphabets (Q2830059) (← links)
- An Accelerated Computational Approach in Proteomics (Q3297215) (← links)
- Full-Text Indexes for High-Throughput Sequencing (Q3305517) (← links)
- Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition (Q4629542) (← links)
- A Filtering Technique for All Pairs Approximate Parameterized String Matching (Q5114858) (← links)
- Parallel String Matching (Q5862565) (← links)
- Approximate Cartesian tree matching: an approach using swaps (Q6545412) (← links)
- Serial and parallel algorithms for order-preserving pattern matching based on the duel-and-sweep paradigm (Q6634510) (← links)
