Referenced Items are not available for this document.
We consider an online 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
Published in:
Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on
(Volume:28
,
Issue:
5
)
Date of Publication: Oct 1998
- Page(s):
- 737 - 739
- ISSN :
- 1083-4419
- INSPEC Accession Number:
- 6036251
- Digital Object Identifier :
- 10.1109/3477.718523
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Oct 1998
- Sponsored by :
- IEEE Systems, Man, and Cybernetics Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
