Results 251 to 260 of about 274,129 (290)

Parallel String Matching Algorithms

Kybernetes, 1988
The string searching problem is central to many information retrieval and text editing applications. The Brute Force algorithm is inefficient in some cases and in this article four other algorithms are discussed, of which the Boyer‐Moore and the Improved Boyer‐Moore are found to be the fastest.
Evans, D. J., Ghanemi, S.
openaire   +1 more source

A string pattern—matching algorithm

Journal of Systems and Software, 1993
Abstract 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

PAMA: A FAST STRING MATCHING ALGORITHM

International Journal of Foundations of Computer Science, 2006
String matching is a fundamental operation in computer science, and its performance has great impact on many applications including database query, text processing, DNA and protein sequence analysis. In this paper, we propose a fast string matching algorithm, PAMA (PAttern MAtching). The shift rule used by PAMA not only subsumes both the bad character
Shiyong Lu, Feng Cao, Yi Lu 0015
openaire   +1 more source

VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING

International Journal of Foundations of Computer Science, 2002
Vector algorithms allow the computation of an output vector r = r1 r2 ⋯ rm given an input vector e = e1 e2 ⋯ em in a bounded number of operations, independent of m the length of the vectors. The allowable operations are usually restricted to bit-wise operations available in processors, including shifts and binary addition with carry.
Anne Bergeron, Sylvie Hamel
openaire   +1 more source

Algorithms on Compressed Strings and Arrays

1999
We survey the complexity issues related to several algorithmic problems for compressed one- and two-dimensional texts without explicit decompression: pattern-matching, equality-testing, computation of regularities, subsegment extraction, language membership, and solvability of word equations.
openaire   +1 more source

Simple Optimal String Matching Algorithm

Journal of Algorithms, 2000
Summary: We present a new string matching algorithm optimal on average (with equiprobability and independence of letters, in \(O(m+ n\log_{|\Sigma|} m/m)\), where \(n\) is the size of the text and \(m\) the size of the searched word, both taken on an alphabet \(\Sigma\)) and linear in the worst case (in \(O(m+ n)\)).
Allauzen, Cyril, Raffinot, Mathieu
openaire   +2 more sources

String matching algorithms and automata

1994
In this paper we study the structure of finite automata recognizing sets of the form A*p, for some word p, and use the results obtained to improve the Knuth-Morris-Pratt string searching algorithm. We also determine the average number of nontrivial edges of the above automata.
openaire   +1 more source

String searching algorithms revisited

1989
We present bounds for the average case of the Knuth-Morris-Pratt (KMP) algorithm and the Boyer-Moore-Horspool (BMH) algorithm for random text. Experimental results in both random and English text suggests that the bounds are tight. We also present a hybrid algorithm which combines the KMP and BMH algorithms, and which, in practice, is faster than the ...
openaire   +1 more source

Algorithms for String Pattern Discovery

2007
Pattern discovery from string data is an important problem with many applications. In this paper, we give a brief overview of our work on the optimal correlated pattern discovery problem, which integrates numerical attribute information into the string pattern discovery process.
openaire   +1 more source

Algorithms for string searching

ACM SIGIR Forum, 1989
We survey several algorithms for searching a string in a piece of text. We include theoretical and empirical results, as well as the actual code of each algorithm. An extensive bibliography is also included.
openaire   +1 more source