Results 241 to 250 of about 274,129 (290)

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 framework to animate string algorithms

Information Processing Letters, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ricardo Baeza-Yates
exaly   +3 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

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   +1 more source

Generic Algorithms for Factoring Strings

2013
In this paper we describe algorithms for factoring words over sets of strings known as circ-UMFFs, generalizations of the well-known Lyndon words based on lexorder, whose properties were first studied in 1958 by Chen, Fox and Lyndon. In 1983 Duval designed an elegant linear-time sequential (RAM) Lyndon factorization algorithm; a corresponding parallel (
David E. Daykin, Jacqueline W. Daykin, Costas S. Iliopoulos, W. F. Smyth   +3 more
openaire   +1 more source

Bounds on algorithms for string generation

Acta Informatica, 1972
The well-known lower bound of log2 n! on the number of comparisons required to sort n items is extended to cover algorithms, such as replacement selection, which produce a sorted string whose length is a random variable. The case of algorithms which produce several strings is also discussed and these results are then applied to obtain an upper bound on
A. C. McKellar, C. K. Wong
openaire   +1 more source

On Simon's string searching algorithm

Information Processing Letters, 1993
We give sharp bounds for the problem of string matching when only one head moving from the right to the left of the text is used: \((2-1/m)n\) character comparisons for all the text, and \(\min \{1+ \log_ 2m,\text{Card}(A)\}\) character comparisons on each character of the text, where \(m\) is the length of the pattern, \(n\) the length of the text ...
openaire   +2 more sources