Results 231 to 240 of about 1,047,077 (291)

Detecting False Matches in String-Matching Algorithms

Algorithmica, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

String Matching Artificial Neural Networks

International Journal of Neural Systems, 2001
Three artificial neural networks (ANNs) are proposed for solving a variety of on- and off-line string matching problems. The ANN structure employed as the building block of these ANNs is derived from the harmony theory (HT) ANN, whereby the resulting string matching ANNs are characterized by fast match-mismatch decisions, low computational complexity,
openaire   +2 more sources

Parameterized string matching

ACM SIGSOFT Software Engineering Notes, 2010
In the problem of parameterized string matching, a given pattern P is said to match with a sub-string t of the text T, if there exists a one-one correspondence between the symbols of P and the symbols of t. This problem has an important application in software maintenance , where it is often required to find ...
Rajesh Prasad, Suneeta Agarwal
openaire   +1 more source

Approximate String Matching

ACM Computing Surveys, 1980
Approximate matching of strings is reviewed with the aim of surveying techniques suitable for finding an item in a database when there may be a spelling mistake or other error in the keyword. The methods found are classified as either equivalence or similarity problems. Equivalence problems are seen to be readily solved using canonical forms.
Patrick A. V. Hall, Geoff R. Dowling
openaire   +1 more source

The WM-q multiple exact string matching algorithm for DNA sequences

Comput. Biol. Medicine, 2021
Abdullah Ammar Karcioglu, Hasan Bulut
semanticscholar   +1 more source

String matching with constraints

2005
Pattern recognition in a constantly growing field of research. Identification of pattern in images, for instance, is a first step towards their interpretation. More generally, all formal systems handling strings of symbols involve parsing phases to recognize certain patterns. Regular expressions is one of the techniques to specify simple patterns [26].
openaire   +2 more sources

String Range Matching

2014
Given strings X and Y the exact string matching problem is to find the occurrences of Y as a substring of X. An alternative formulation asks for the lexicographically consecutive set of suffixes of X that begin with Y. We introduce a generalization called string range matching where we want to find the suffixes of X that are in an arbitrary ...
Kempa Dominik, Kärkkäinen Juha, Puglisi Simon J.   +2 more
openaire   +1 more source

Approximate Boyer–Moore String Matching

SIAM Journal on Computing, 1993
Summary: The Boyer-Moore idea applied in exact string matching is generalized to approximate string matching. Two versions of the problem are considered. The \(k\) mismatches problem is to find all approximate occurrences of a pattern string (length \(m\)) in a text string (length \(n\)) with at most \(k\) mismatches.
Tarhio, Jorma, Ukkonen, Esko
openaire   +2 more sources

A guided tour to approximate string matching

CSUR, 2001
G. Navarro
semanticscholar   +1 more source

Fastest Pattern Matching in Strings

Journal of Algorithms, 1994
Summary: An algorithm is presented that substantially improves the algorithm of Boyer and Moore for pattern matching in strings, both in the worst case and in the average. Both the Boyer and Moore algorithm and the new algorithm assumes that the characters in the pattern and in the text are taken from a given alphabet \(\Sigma\) of finite size. The new
openaire   +2 more sources