Results 1 to 10 of about 35,772 (302)
Some of the next articles are maybe not open access.
Approximate string matching with gaps.
Nord. J. Comput., 2002Summary: We consider several new versions of approximate string matching with gaps. The main characteristic of these new versions is the existence of gaps in the matching of a given pattern in a text. Algorithms are devised for each version and their time and space complexities are stated.
Crochemore, Maxime +5 more
openaire +2 more sources
Average Optimal String Matching in Packed Strings
2013In this paper we are concerned with the basic problem of string pattern matching: preprocess one or multiple fixed strings over alphabet σ so as to be able to efficiently search for all occurrences of the string(s) in a given text T of length n. In our model, we assume that text and patterns are tightly packed so that any single character occupies logσ
Djamal Belazzougui, Mathieu Raffinot
openaire +1 more source
A string pattern—matching algorithm
Journal of Systems and Software, 1993Abstract A string pattern-matching algorithm uses a character string, pattern , to search another character string, text , for the first or all occurrence(s) of the pattern in the text. This article presents a string patternmatching algorithm using a mapping table and an automaton. The number of states of the automaton is equal to the length of the
openaire +1 more source
The exact online string matching problem
ACM Computing Surveys, 2013Simone Faro, Thierry Lecroq
exaly
Fast and practical approximate string matching
Information Processing Letters, 1996Ricardo Baeza-Yates
exaly
VLSI architectures for string matching and pattern matching
Pattern Recognition, 1987H D Cheng
exaly
Two-dimensional object recognition through two-stage string matching
IEEE Transactions on Image Processing, 1999Mao-Jiun Wang
exaly
Attributed String Matching with Merging for Shape Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence, 1985Wen-Hsiang Tsai, Shiaw-Shian Yu
exaly