On-Line Serial and Parallel String Searching
نویسنده
چکیده
String searching is a pervasive primitive of computation. In on-line string searching, the text string is given in advance, but it is required that, as soon as one finishes reading a pattern, it must be possible to decide whether or not it occurs in the text. This paper surveys serial and parallel methods fOT on-line string searching. The auxiliary structures used aTe also suited to a host of other applications.
منابع مشابه
An Intelligent Computer Interface Utilizing Parallel Picocontrollers (TECHNICAL NOTE)
The design of an interface unit is described, in which RS232 serial data is converted to latched parallel data on 22 independent lines. The data direction of each line is programmable through the serial port. Two picocontrollers are employed in a parallel processing mode to give the required number of I/O pins, and data on the shared serial line is coded to separate data streams to the individu...
متن کاملOn a Parallel-Algorithms Method for String Matching Problems
Suux trees are the main data-structure in string matching algorithmics. There are several serial algorithms for suux tree construction which run in linear time, but the number of operations in the only parallel algorithm available, due to Apostolico, Iliopoulos, Landau, Schieber and Vishkin, is proportional to n log n. The algorithm is based on labeling substrings, similar to a classical serial...
متن کاملImplementation of Rabin Karp String Matching Algorithm Using MPI
Searching for occurrences of string patterns is a common problem in many applications. One of the easiest approaches is to search a pattern in a text character by character. But this method becomes very slow when we deal with long patterns. Various good solutions like Naïve string Matcher, Knuth-Morris-Pratt (KMP), Rabin Karp (RK), etc have already been presented for string matching and we sele...
متن کاملTwo-Dimensional Periodicity in Rectangular Arrays
String matching is rich with a variety of algorithmic tools. In contrast, multidimensional matching has had a rather sparse set of techniques. This paper presents a new algorithmic technique for two-dimensional matching: periodicity analysis. Its strength appears to lie in the fact that it is inherently two-dimensional. Periodicity in strings has been used to solve string matching problems. Mul...
متن کاملString Editing and Longest Common
The string editing problem for input strings x and y consists of transforming x into y by performing a series of weighted edit operations on x of overall minimum cost. An edit operation on x can be the deletion of a symbol from x, the insertion of a symbol in x or the substitution of a symbol of x with another symbol. String editing models a variety of problems arising in such diverse areas as ...
متن کامل