Results 151 to 160 of about 70,442,116 (202)

Systolic Algorithms for String Manipulations

IEEE Transactions on Computers, 1984
One-and two-dimensional pattern matching oriented systolic array processors are presented that support, respectively, the detection of all repetitions in a string x and the statistics of all substrings of x with and without overlap. The time is linear in the length of x in both applications, whereas the number of processors is linear and quadratic ...
Alberto Apostolico, Alberto Negro
openaire   +2 more sources

Algorithms on Strings

2007
The book is intended for lectures on string processes and pattern matching in Master's courses of computer science and software engineering curricula. The details of algorithms are given with correctness proofs and complexity analysis, which make them ready to implement. Algorithms are described in a C-like language.
Crochemore, Maxime, Hancart, Christophe, Lecroq, Thierry   +2 more
openaire   +2 more sources

A fast string searching algorithm

Communications of the ACM, 1977
An algorithm is presented that searches for the location, “ i l” of the first occurrence of a character string, “ pat ,” in another string, “ string .” During the search operation, the characters of pat are matched starting with the last ...
Robert S. Boyer, J Strother Moore
openaire   +1 more source

An Improved Algorithm for Approximate String Matching

Lecture Notes in Computer Science, 1989
Given a text string, a pattern string, and an integer k, a new algorithm for finding all occurrences of the pattern string in the text string with at most k differences is presented. Both its theoretical and practical variants improve the known algorithms.
Kunsoo Park, Zvi Galil
exaly   +5 more sources

A parallel string search algorithm

IEEE Transactions on Systems, Man, and Cybernetics, 1992
A new parallel processing algorithm for solving string search problems is presented. The proposed algorithm uses O(m*n) processors where n is the length of a text and m is the length of a pattern. It requires two and only two iteration steps to find the pattern in the text, while the best existing parallel algorithm needs the computation time O(loglog ...
Yoshiyasu Takefuji, Toshimitsu Tanaka, Kuo Chun Lee   +2 more
openaire   +1 more source

A New String Matching Algorithm

International Journal of Computer Mathematics, 2003
In this paper a new exact string-matching algorithm with sub-linear average case complexity has been presented. Unlike other sub-linear string-matching algorithms it never performs more than n text character comparisons while working on a text of length n. It requires only O(mþs) extra pre-processing time and space, where m is the length of the pattern
Mustaq Ahmed, M. Kaykobad, Rezaul Alam Chowdhury   +2 more
openaire   +2 more sources