The following pages link to Fast Pattern Matching in Strings (Q4148937):
Displaying 50 items.
- Tight bounds on the complexity of the Apostolico-Giancarlo algorithm (Q287179) (← links)
- Document retrieval with one wildcard (Q287451) (← links)
- Automata evaluation and text search protocols with simulation-based security (Q290379) (← links)
- K-M-P string matching revisited (Q293129) (← links)
- Efficient special cases of pattern matching with swaps (Q293429) (← links)
- Set intersection and sequence matching with mismatch counting (Q294918) (← links)
- Permuted scaled matching (Q294926) (← links)
- Compression of finite-state automata through failure transitions (Q300258) (← links)
- Closed factorization (Q313756) (← links)
- Periodicity in rectangular arrays (Q344541) (← links)
- On pattern matching with \(k\) mismatches and few don't cares (Q344551) (← links)
- A new filtration method and a hybrid strategy for approximate string matching (Q385045) (← links)
- Simple real-time constant-space string matching (Q390869) (← links)
- Compressed indexes for text with wildcards (Q390873) (← links)
- Enhanced string covering (Q393116) (← links)
- Algorithms for path-constrained sequence alignment (Q396718) (← links)
- Counting the palstars (Q405318) (← links)
- Fast and flexible packed string matching (Q405577) (← links)
- On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns (Q414441) (← links)
- String matching with alphabet sampling (Q414445) (← links)
- A new efficient indexing algorithm for one-dimensional real scaled patterns (Q414881) (← links)
- A compact representation of nondeterministic (suffix) automata for the bit-parallel approach (Q418159) (← links)
- Efficient retrieval of approximate palindromes in a run-length encoded string (Q428850) (← links)
- Average complexity of backward \(q\)-gram string matching algorithms (Q436556) (← links)
- Efficient algorithms for local ranking (Q436589) (← links)
- String matching with variable length gaps (Q442239) (← links)
- Worst-case efficient single and multiple string matching on packed texts in the word-RAM model (Q450552) (← links)
- An algorithmic toolbox for periodic partial words (Q477348) (← links)
- Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion (Q489728) (← links)
- A generic framework for symbolic execution: a coinductive approach (Q507361) (← links)
- Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings (Q507391) (← links)
- Linear-time computation of prefix table for weighted strings {\&} applications (Q507393) (← links)
- Two fast constructions of compact representations of binary words with given set of periods (Q507396) (← links)
- Generalized pattern matching and periodicity under substring consistent equivalence relations (Q507402) (← links)
- Efficient computation of maximal anti-exponent in palindrome-free strings (Q507406) (← links)
- Designing optimal- and fast-on-average pattern matching algorithms (Q511153) (← links)
- Quantum pattern matching fast on average (Q513289) (← links)
- A grouping approach for succinct dynamic dictionary matching (Q513298) (← links)
- Faster string matching based on hashing and bit-parallelism (Q522976) (← links)
- Fast searching in packed strings (Q533408) (← links)
- Pattern matching in pseudo real-time (Q533411) (← links)
- Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics (Q534777) (← links)
- A quick tour on suffix arrays and compressed suffix arrays (Q544881) (← links)
- Linear time algorithms for generalizations of the longest common substring problem (Q547294) (← links)
- Bounded hairpin completion (Q553314) (← links)
- La reconnaissance des facteurs d'un mot dans un texte (Q580994) (← links)
- Simple and efficient string matching with k mismatches (Q582093) (← links)
- String-matching with OBDDs (Q596086) (← links)
- The submatrices character count problem: An efficient solution using separable values (Q598188) (← links)
- A series of algorithmic results related to the iterated hairpin completion (Q606982) (← links)
