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,...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Information processing letters Ročník 85; číslo 5; s. 255 - 260
Hlavní autor: Misra, Jayadev
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 16.03.2003
Elsevier Science
Elsevier Sequoia S.A
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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, PhD Thesis, 1997; J. Misra, ACM Trans. Programming Languages Systems 16 (6) (1994) 1737–1740] is central to the development of the algorithm and its algebraic manipulations.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0020-0190
1872-6119
DOI:10.1016/S0020-0190(02)00416-7