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

Hiroshi UMEO

Copy

Hiroshi UMEO, "A Two-Dimensional Generalization of Mukhopadhyay's Parallel String Matching Algorithm" in IEICE TRANSACTIONS on transactions, vol. E68-E, no. 7, pp. 411-412, July 1985, doi: .
Abstract: 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 lk² 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.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e68-e_7_411/_p

Copy

@ARTICLE{e68-e_7_411,
author={Hiroshi UMEO, },
journal={IEICE TRANSACTIONS on transactions},
title={A Two-Dimensional Generalization of Mukhopadhyay's Parallel String Matching Algorithm},
year={1985},
volume={E68-E},
number={7},
pages={411-412},
abstract={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 lk² 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.},
keywords={},
doi={},
ISSN={},
month={July},}

Copy

TY - JOUR
TI - A Two-Dimensional Generalization of Mukhopadhyay's Parallel String Matching Algorithm
T2 - IEICE TRANSACTIONS on transactions
SP - 411
EP - 412
AU - Hiroshi UMEO
PY - 1985
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E68-E
IS - 7
JA - IEICE TRANSACTIONS on transactions
Y1 - July 1985
AB - 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 lk² 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.
ER -