Derivation of a parallel string matching algorithm

We derive an efficient parallel algorithm to find all occurrences of a pattern string in a subject string in O(log n) time, where n is the length of the subject string. The number of processors employed is of the order of the product of the two string lengths. The theory of powerlists [J. Kornerup,...

Full description

Saved in:

Bibliographic Details
Published in:	Information processing letters Vol. 85; no. 5; pp. 255 - 260
Main Author:	Misra, Jayadev
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 16.03.2003 Elsevier Science Elsevier Sequoia S.A
Subjects:	Algorithms Applied sciences Computer science; control theory; systems Data processing. List processing. Character string processing Data structures Exact sciences and technology Memory organisation. Data processing Parallel algorithms Powerlist Software String Studies Data structures String Parallel algorithms Powerlist Order Parallel algorithm Processor Theory String matching System programming Product Time System 1997 1994 Programming language Number Length Development Data structure Pattern matching
ISSN:	0020-0190, 1872-6119
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!