The following pages link to Fast Pattern Matching in Strings (Q4148937):
Displaying 50 items.
- Distinct squares in run-length encoded strings (Q606988) (← links)
- Efficient index for retrieving top-\(k\) most frequent documents (Q616994) (← links)
- Negative selection algorithms on strings with efficient training and linear-time classification (Q627104) (← links)
- Verifying and enumerating parameterized border arrays (Q650937) (← links)
- How the character comparison order shapes the shift function of on-line pattern matching algorithms (Q671355) (← links)
- A fast algorithm for string matching with mismatches (Q672410) (← links)
- Multiple matching of parameterized patterns (Q672748) (← links)
- Parallel detection of all palindromes in a string (Q673783) (← links)
- Fast parallel string prefix-matching (Q674342) (← links)
- A sheaf-theoretic approach to pattern matching and related problems (Q685382) (← links)
- On Simon's string searching algorithm (Q685473) (← links)
- Tight comparison bounds for the string prefix-matching problem (Q685487) (← links)
- The Möbius function of factor order (Q688683) (← links)
- On approximate jumbled pattern matching in strings (Q692932) (← links)
- On some operations on strings suggested by gene assembly in ciliates (Q698885) (← links)
- Linear-time computation of local periods (Q703549) (← links)
- Characteristic Sturmian words are extremal for the critical factorization theorem (Q714825) (← links)
- A theory of ultimately periodic languages and automata with an application to time granularity (Q731330) (← links)
- On the size of Boyer-Moore automata (Q732040) (← links)
- Palindromic rich words and run-length encodings (Q738876) (← links)
- Computationally secure pattern matching in the presence of malicious adversaries (Q744607) (← links)
- Gray code orders for \(q\)-ary words avoiding a given factor (Q748433) (← links)
- Efficient indexing algorithms for one-dimensional discretely-scaled strings (Q765528) (← links)
- Computing a longest common subsequence for a set of strings (Q786541) (← links)
- An analytical comparison of two string searching algorithms (Q800732) (← links)
- Essence of generalized partial computation (Q808278) (← links)
- Optimal superprimitivity testing for strings (Q811134) (← links)
- Derivation of efficient logic programs by specialization and reduction of nondeterminism (Q815006) (← links)
- A complete mechanization of correctness of a string-preprocessing algorithm (Q816208) (← links)
- Regular algebra applied to language problems (Q817577) (← links)
- Approximate string matching using compressed suffix arrays (Q818136) (← links)
- Novel results on the number of runs of the Burrows-Wheeler-transform (Q831816) (← links)
- Scaled and permuted string matching (Q834966) (← links)
- A coarse-grained multicomputer algorithm for the detection of repetitions (Q835058) (← links)
- Resource scheduling with variable requirements over time (Q835625) (← links)
- Light-based string matching (Q835975) (← links)
- A fast algorithm for finding the positions of all squares in a run-length encoded string (Q837185) (← links)
- Accelerating Boyer-Moore searches on binary texts (Q840783) (← links)
- An optimizing compiler for parallel chemistry simulations (Q842842) (← links)
- Construction of Aho Corasick automaton in linear time for integer alphabets (Q844159) (← links)
- Multiple serial episodes matching (Q844201) (← links)
- On obtaining the Boyer-Moore string-matching algorithm by partial evaluation (Q845710) (← links)
- Pattern matching with don't cares and few errors (Q847263) (← links)
- The origins of combinatorics on words (Q872058) (← links)
- Compact and tractable automaton-based representations of time granularities (Q875518) (← links)
- A unifying look at the Apostolico--Giancarlo string-matching algorithm (Q876692) (← links)
- Some string matching problems from bioinformatics which still need better solutions (Q876702) (← links)
- Practical and flexible pattern matching over Ziv-Lempel compressed text. (Q878012) (← links)
- String matching and 1d lattice gases (Q878347) (← links)
- A filtration method for order-preserving matching (Q894438) (← links)
