Results 221 to 230 of about 1,296,078 (273)
Some of the next articles are maybe not open access.
Faster Approximate String Matching
Algorithmica, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ricardo A. Baeza-Yates +1 more
openaire +2 more sources
On approximate string matching
[Proceedings] DCC `93: Data Compression Conference, 2002Two practical universal source coding schemes are proposed. One is an approximate fixed length string matching data compression, and the other is LZ-type quasi parsing by approximate string matching. It is shown that in the former algorithm the compression rate converges to the theoretical bound of R(D) for a large class of processes as the database ...
openaire +1 more source
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 ...
Juha Kärkkäinen +2 more
openaire +1 more source
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 ...
Juha Kärkkäinen +2 more
openaire +1 more source
String Matching with Involutions
2012We propose a novel algorithm for locating in a text T every occurrence of a string that can be obtained from a given pattern P by successively applying antimorphic involutions on some of its factors. When the factors on which these involutions are applied overlap, a linear time algorithm is obtained.
Cristian Grozea +3 more
openaire +1 more source
Fast Pattern Matching in Strings
SIAM Journal on Computing, 1977An algorithm is presented which finds all occurrences of one given string within another, in running time proportional to the sum of the lengths of the strings. The constant of proportionality is low enough to make this algorithm of practical use, and the procedure can also be extended to deal with some more general pattern-matching problems.
Donald E. Knuth +2 more
openaire +1 more source
1995
In this paper we consider the string matching problem in hypertext, which is a nonlinear structure of text. We model the hypertext as a directed graph G = (V, E), where each node v ∃ V has text T v associated with it and each link (v, w) ∃ E connects the end of text T v to the start of text T w .
Kunsoo Park, Dong Kyue Kim
openaire +1 more source
In this paper we consider the string matching problem in hypertext, which is a nonlinear structure of text. We model the hypertext as a directed graph G = (V, E), where each node v ∃ V has text T v associated with it and each link (v, w) ∃ E connects the end of text T v to the start of text T w .
Kunsoo Park, Dong Kyue Kim
openaire +1 more source
String matching with constraints
2005Pattern 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
On the string matching with k mismatches
Theoretical Computer Science, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yangjun Chen, Yujia Wu
openaire +2 more sources
Detecting False Matches in String-Matching Algorithms
Algorithmica, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
The WM-q multiple exact string matching algorithm for DNA sequences
Comput. Biol. Medicine, 2021Abdullah Ammar Karcioglu, Hasan Bulut
semanticscholar +1 more source