The search functionality is under construction.

IEICE TRANSACTIONS on transactions

A Two-Dimensional Generalization of Mukhopadhyay's Parallel String Matching Algorithm

Hiroshi UMEO

  • Full Text Views

    0

  • Cite this

Summary :

This paper presents a parallel two-dimensional array matching algorithm which can report all occurrences of a given key subarray of size kk within any text array of size nn in n nk1/l steps on lk2 comparator cells, where l(1ln) is the number of matching units. Our algorithm can be regarded as a two-dimensional generalization of Mukhopadhyay's parallel string matching algorithm.

Publication
IEICE TRANSACTIONS on transactions Vol.E68-E No.7 pp.411-412
Publication Date
1985/07/25
Publicized
Online ISSN
DOI
Type of Manuscript
LETTER
Category
Automata and Languages

Authors

Keyword