Optimal neural network algorithm for on-line string matching

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

*Corresponding author for this work

Research output: Contribution to journalJournal articlepeer-review

2 Citations (Scopus)


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 languageEnglish
Pages (from-to)737-739
Number of pages3
JournalIEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Issue number5
Publication statusPublished - 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


Dive into the research topics of 'Optimal neural network algorithm for on-line string matching'. Together they form a unique fingerprint.

Cite this