AN O(1) TIME ALGORITHM FOR STRING MATCHING

被引：7

作者：

CHEN, GH

机构：

[1] Department of Computer Science and information Engineering, National Taiwan University, Taipei

来源：

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS | 1992年 / 42卷 / 3-4期

关键词：

PROCESSOR ARRAY; RECONFIGURABLE BUS SYSTEM; STRING MATCHING;

D O I：

10.1080/00207169208804061

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

An O(1) time algorithm for string matching is designed on a two-dimensional (n - m + 1) x n processor array with a reconfigurable bus system, where n and m are the length of text and pattern respectively.

引用

页码：185 / 191

页数：7

共 10 条

[1] FAST STRING SEARCHING ALGORITHM [J].

BOYER, RS ;

MOORE, JS .

COMMUNICATIONS OF THE ACM, 1977, 20 (10) :762-772

[2]

GALIL Z, 1984, 16TH P ACM S THEOR C, P240

[3]

GALIL Z, 1979, 11TH P ANN ACM S THE, P13

[4]

KNUTH DE, 1977, SIAM J COMPUT, V6, P240

[5] POLYMORPHIC-TORUS NETWORK [J].

LI, HW ;

MARESCA, M .

IEEE TRANSACTIONS ON COMPUTERS, 1989, 38 (09) :1345-1351

[6] POLYMORPHIC-TORUS ARCHITECTURE FOR COMPUTER VISION [J].

LI, HW ;

MARESCA, M .

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1989, 11 (03) :233-243

[7] CONNECTION AUTONOMY IN SIMD COMPUTERS - A VLSI IMPLEMENTATION [J].

MARESCA, M ;

LI, HW .

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1989, 7 (02) :302-320

[8]

Miller R., 1988, Proceedings of the 1988 International Conference on Parallel Processing, P205

[9] BUS AUTOMATA, BRAINS, AND MENTAL MODELS [J].

ROTHSTEIN, J .

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1988, 18 (04) :522-531

[10]

VISHKIN U, 1985, P INT C ALGEBRAIC LO

← 1 →