Efficient string matching

Cited in

(only showing first 100 items - show all)

Testing avoidability on sets of partial words is hard
Average-optimal string matching
Two-dimensional pattern matching by two-dimensional on-line tessellation acceptors
An \(O(| T| ^ 3)\) algorithm for testing the Church-Rosser property of Thue systems
The smallest automaton recognizing the subwords of a text
La reconnaissance des facteurs d'un langage fini dans un texte en temps linéaire. (Recognition of the factors of a finite language in a text in linear time)
A polynomial algorithm testing partial confluence of basic semi-Thue systems
Inventories of unavoidable languages and the word-extension conjecture
On updating suffix tree labels
Analysis of two-dimensional approximate pattern matching algorithms
A string searching algorithm
Fast string searching by finding subkeys in subtext
Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
A string-matching interpretation of the equation x^ m y^ n = z^ p
Fast average-case pattern matching by multiplexing sparse tables
A practical method for implementing string pattern matching machines
On finding common subtrees
Fast two-dimensional pattern matching
Two-dimensional dictionary matching
Optimal parallel two dimensional text searching on a CREW PRAM
Dynamic dictionary matching in external memory
On computing all suboptimal alignments
Cut and paste
Alphabet dependence in parameterized matching
Dynamic dictionary matching with failure functions
Sublinear approximate string matching and biological applications
Pattern matching in a digitized image
Dynamic dictionary matching
A fast algorithm for the unique decipherability of multivalued encodings
Efficient matching of nonrectangular shapes.
The shortest path problem with forbidden paths
Fast pattern matching in indexed texts
An efficient null-free procedure for deciding regular language membership
A fast algorithm for the all-pairs suffix-prefix problem
Dictionary matching with a bounded gap in pattern or in text
Universal compressed text indexing
On string matching with mismatches
On-line weighted pattern matching
On the string matching with \(k\) mismatches
Genome wide study of NF-Y type CCAAT boxes in unidirectional and bidirectional promoters in human and mouse
An improvement of the Aho-Corasick machine
Transducers and repetitions
Integrating code generation and peephole optimization
Fast and practical approximate string matching
Tree pattern matching with a more general notion of occurrence of the pattern.
Reducing space for index implementation.
A new regular grammar pattern matching algorithm.
Average complexity of exact and approximate multiple string matching
On-line construction of suffix trees
On the look-ahead problem in lexical analysis
A subquadratic algorithm for approximate limited expression matching
Permuted pattern matching algorithms on multi-track strings
Internal dictionary matching
A comparative study of dictionary matching with gaps: limitations, techniques and challenges
On the complexity of recognizing Wheeler graphs
Streaming dictionary matching with mismatches
A set automaton to locate all pattern matches in a term
Counting ternary square-free words quickly
VoCSK: verb-oriented commonsense knowledge mining with taxonomy-guided induction
All-pairs suffix/prefix in optimal time using Aho-Corasick space
Safety and completeness in flow decompositions for RNA assembly
Stochastic analysis of minimal automata growth for generalized strings
Finding patterns and periods in Cartesian tree matching
Online parameterized dictionary matching with one gap
Fast algorithms for single and multiple pattern Cartesian tree matching
Online recognition of dictionary with one gap
Parameterized dictionary matching and recognition with one gap
A framework for designing space-efficient dictionaries for parameterized and order-preserving matching
Block trees
Automata for solid codes
An algorithm for deciding the finiteness of the number of simple permutations in permutation classes
A parameterized multilevel pattern matching architecture on FPGAs for network intrusion detection and prevention
Fast parallel and serial multidimensional approximate array matching
Hierarchical overlap graph
On algorithms that effectively distinguish gradient-like dynamics on surfaces
Efficient dynamic dictionary matching with DAWGs and AC-automata
Conjugacy in Artin groups of extra-large type.
Compressed automata for dictionary matching
Dictionary matching with a few gaps
Compressing dictionary matching index via sparsification technique
On-line string matching in highly similar DNA sequences
On representations of ternary order relations in numeric strings
Factor theory and the unity of opposites
Succinct 2D dictionary matching
Faster exact distributions of pattern statistics through sequential elimination of states
Pseudoknot-generating operation
Mind the gap!
State complexity of pattern matching in regular languages
Fast trie-based method for multiple pairwise sequence alignment
Revisiting multiple pattern matching algorithms for multi-core architecture
Towards optimal packed string matching
Simple and efficient LZW-compressed multiple pattern matching
Time-space trade-offs for longest common extensions
An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints
Prefix-free regular languages and pattern matching
Parsing with a finite dictionary
Distribution of statistics of hidden state sequences through the sum-product algorithm
On minimizing pattern splitting in multi-track string matching
Sequential and indexed two-dimensional combinatorial template matching allowing rotations
Components and acyclicity of graphs. An exercise in combining precision with concision

This page was built for publication: Efficient string matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4055184)