Optimal neural network algorithm for on-line string matching

Yiu Wing Leung; Jiang She Zhang; Zong Ben Xu

doi:10.1109/3477.718523

Optimal neural network algorithm for on-line string matching

Yiu Wing Leung^*, Jiang She Zhang, Zong Ben Xu

^*Corresponding author for this work

Department of Computer Science

Research output: Contribution to journal › Journal article › peer-review

2 Citations (Scopus)

Abstract

We consider an on-line string matching problem in which we find all the occurrences of a pattern of m characters in a text of n characters, where all the characters of the pattern are available before processing while the characters of the text are input one after the other. We propose a space-time optimal parallel algorithm for this problem using a neural network approach. This algorithm uses m McCulloch-Pitts neurons connected as a linear array. It processes every input character of the text in one step and hence it requires at most n iteration steps.

Original language	English
Pages (from-to)	737-739
Number of pages	3
Journal	IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Volume	28
Issue number	5
DOIs	https://doi.org/10.1109/3477.718523
Publication status	Published - Oct 1998

Scopus Subject Areas

Control and Systems Engineering
Software
Information Systems
Human-Computer Interaction
Computer Science Applications
Electrical and Electronic Engineering

User-Defined Keywords

Algorithms
Neural network
String matching

Access to Document

10.1109/3477.718523

Cite this

@article{fd7a4bfade6841cfa4bed1c67a881fb0,

title = "Optimal neural network algorithm for on-line string matching",

abstract = "We consider an on-line string matching problem in which we find all the occurrences of a pattern of m characters in a text of n characters, where all the characters of the pattern are available before processing while the characters of the text are input one after the other. We propose a space-time optimal parallel algorithm for this problem using a neural network approach. This algorithm uses m McCulloch-Pitts neurons connected as a linear array. It processes every input character of the text in one step and hence it requires at most n iteration steps.",

keywords = "Algorithms, Neural network, String matching",

author = "Leung, {Yiu Wing} and Zhang, {Jiang She} and Xu, {Zong Ben}",

year = "1998",

month = oct,

doi = "10.1109/3477.718523",

language = "English",

volume = "28",

pages = "737--739",

journal = "IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics",

issn = "1083-4419",

publisher = "IEEE",

number = "5",

}

TY - JOUR

T1 - Optimal neural network algorithm for on-line string matching

AU - Leung, Yiu Wing

AU - Zhang, Jiang She

AU - Xu, Zong Ben

PY - 1998/10

Y1 - 1998/10

N2 - We consider an on-line string matching problem in which we find all the occurrences of a pattern of m characters in a text of n characters, where all the characters of the pattern are available before processing while the characters of the text are input one after the other. We propose a space-time optimal parallel algorithm for this problem using a neural network approach. This algorithm uses m McCulloch-Pitts neurons connected as a linear array. It processes every input character of the text in one step and hence it requires at most n iteration steps.

AB - We consider an on-line string matching problem in which we find all the occurrences of a pattern of m characters in a text of n characters, where all the characters of the pattern are available before processing while the characters of the text are input one after the other. We propose a space-time optimal parallel algorithm for this problem using a neural network approach. This algorithm uses m McCulloch-Pitts neurons connected as a linear array. It processes every input character of the text in one step and hence it requires at most n iteration steps.

KW - Algorithms

KW - Neural network

KW - String matching

UR - http://www.scopus.com/inward/record.url?scp=0032187592&partnerID=8YFLogxK

U2 - 10.1109/3477.718523

DO - 10.1109/3477.718523

M3 - Journal article

AN - SCOPUS:0032187592

SN - 1083-4419

VL - 28

SP - 737

EP - 739

JO - IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

JF - IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

IS - 5

ER -

Optimal neural network algorithm for on-line string matching

Abstract

Scopus Subject Areas

User-Defined Keywords

Access to Document

Other files and links

Fingerprint

Cite this