The following pages link to A fast string searching algorithm (Q3090391):
Displayed 50 items.
- An algorithm to compute the character access count distribution for pattern matching algorithms (Q1736492) (← links)
- A faster quick search algorithm (Q1736618) (← links)
- On-line weighted pattern matching (Q1740646) (← links)
- On the string matching with \(k\) mismatches (Q1743717) (← links)
- A randomized numerical aligner (rNA) (Q1757842) (← links)
- The wide window string matching algorithm (Q1770398) (← links)
- Partial words and the critical factorization theorem (Q1770435) (← links)
- Improved pattern-scan-order algorithms for string matching (Q1784983) (← links)
- An improvement of the Aho-Corasick machine (Q1818793) (← links)
- Transducers and repetitions (Q1820587) (← links)
- Two-pattern strings. I: A recognition algorithm (Q1827270) (← links)
- Time-space-optimal string matching (Q1838329) (← links)
- Correctness of substring-preprocessing in Boyer-Moore's pattern matching algorithm (Q1853605) (← links)
- Application of max-plus algebra to biological sequence comparisons (Q1870593) (← links)
- A new regular grammar pattern matching algorithm. (Q1874408) (← links)
- Multiple filtration and approximate pattern matching (Q1902470) (← links)
- A subquadratic algorithm for approximate limited expression matching (Q1907030) (← links)
- Approximate Boyer-Moore string matching for small alphabets (Q1957645) (← links)
- Permuted pattern matching algorithms on multi-track strings (Q2003324) (← links)
- Order-preserving pattern matching indeterminate strings (Q2105413) (← links)
- Quantum algorithm for learning secret strings and its experimental demonstration (Q2111665) (← links)
- The Range Automaton: an efficient approach to text-searching (Q2140462) (← links)
- Efficient online string matching based on characters distance text sampling (Q2205639) (← links)
- Fast algorithms for single and multiple pattern Cartesian tree matching (Q2215968) (← links)
- A parameterized multilevel pattern matching architecture on FPGAs for network intrusion detection and prevention (Q2267141) (← links)
- Fast parallel and serial multidimensional approximate array matching (Q2277849) (← links)
- Milestones from the Pure Lisp Theorem Prover to ACL2 (Q2280212) (← links)
- Succinct non-overlapping indexing (Q2285052) (← links)
- The order-preserving pattern matching problem in practice (Q2295620) (← links)
- A brief history of parameterized matching problems (Q2295633) (← links)
- Fast string matching for DNA sequences (Q2297856) (← links)
- Sliding suffix tree (Q2331636) (← links)
- Conjugacy in Artin groups of extra-large type. (Q2343503) (← links)
- Weighted approximate parameterized string matching (Q2409763) (← links)
- Order-preserving matching (Q2437748) (← links)
- Towards optimal packed string matching (Q2437754) (← links)
- Approximating the maximum consecutive subsums of a sequence (Q2437755) (← links)
- Partial words and the critical factorization theorem revisited (Q2456370) (← links)
- Efficient one-dimensional real scaled matching (Q2457290) (← links)
- Prefix-free regular languages and pattern matching (Q2465647) (← links)
- Generalized function matching (Q2466014) (← links)
- Fast string matching by using probabilities: on an optimal mismatch variant of Horspool's algorithm (Q2503305) (← links)
- Bit-parallel (\(\delta ,\gamma\))-matching and suffix automata (Q2569397) (← 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)
- On-line string matching algorithms: survey and experimental results (Q2720122) (← links)
- Fast string matching for multiple searches (Q2745228) (← links)
- NR‐grep: a fast and flexible pattern‐matching tool (Q2785069) (← links)
- Fast String Matching in Stationary Ergodic Sources (Q2785374) (← links)
- Efficient Algorithms for the Order Preserving Pattern Matching Problem (Q2830069) (← links)