Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 42, 1992 - Issue 3-4
Submit an article Journal homepage
7
Views
8
CrossRef citations to date
0
Altmetric
Original Articles

An 0(1) time algorithm for string matching

Gen-Huey Chen Department of Computer Science and Information Engineering, National Taiwan University, Taiwan, Taipei, Republic of China
Pages 185-191 | Received 17 Oct 1990, Published online: 19 Mar 2007

Citations (8)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (1)

Clive N. Galley. (1994) On the lower bound for parallel string matching. International Journal of Computer Mathematics 53:3-4, pages 129-133.
Read now

Articles from other publishers (7)

Y. Ben-Asher & E. Stein. (2002) Basic algorithms for the asynchronous reconfigurable mesh. Basic algorithms for the asynchronous reconfigurable mesh.
TATIANA TAMBOURATZIS. (2011) STRING MATCHING ARTIFICIAL NEURAL NETWORKS. International Journal of Neural Systems 11:05, pages 445-453.
Crossref
A. Mei & A.A. Bertossi. (2000) A residue number system on reconfigurable mesh with applications to prefix sums and approximate string matching. IEEE Transactions on Parallel and Distributed Systems 11:11, pages 1186-1199.
Crossref
Chi-Jung Kuo, Chiun-Chieh Hsu & Wei-Chen Fang. (1999) Parallel directed graph algorithms on directional processor arrays with reconfigurable bus systems. New Generation Computing 17:2, pages 175-200.
Crossref
Yiu-Wing Leung, Jiang-She Zhang & Zong-Ben Xu. (1998) Optimal neural network algorithm for on-line string matching. IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) 28:5, pages 737-739.
Crossref
C.H. Leung & C.Y. Suen. (1998) Matching of complex patterns by energy minimization. IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) 28:5, pages 712-720.
Crossref
K. -L. Chung. (1995) Fast string matching algorithms for run-length coded stringsSchnelle Algorithmen zum Auffinden runlängen-codierter Zeichenketten. Computing 54:2, pages 119-125.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.