String matching: comparative study of algorithms, and its relation to problems of parallel and distributed computing
This work provides a comparative study of string-matching algorithms and their relationship to problems in parallel and distributed computing. Chapters one and two discuss the Knuth-Morris-Pratt and Boyer-Moore algorithms. These optimal serial approaches to string matching provide a reference point against which their parallel counterparts in chapters three through five may be judged. Galil's parallel algorithm in chapter three searches for prefixes of the pattern of increasing length that occur within the text string. Vishkin's algorithm, described in chapter four, employs the concept of duels between various text positions to obtain a sparse set of indices within the text in which the pattern might begin. In chapter five the Rabin-Karp algorithm is outlined. This approach uses hashing functions called fingerprints, rather than character comparisons, as its basic operation. Chapter six outlines an architecture for a parallel process for Galil's algorithm. In the process of specifying his design, the authors considers sorting algorithms, connection networks, and various paradigms for data broadcasting.
- Research Organization:
- City Univ. of New York, NY (USA)
- OSTI ID:
- 6437692
- Resource Relation:
- Other Information: Thesis (Ph. D.)
- Country of Publication:
- United States
- Language:
- English
Similar Records
Neweyes: A system for comparing biological sequences using the Running Karp-Rabin Greedy String-Tiling algorithm
Efficient Aho-Corasick String Matching on Emerging Multicore Architectures