Technical correspondence

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Technical correspondence

Full text

Pdf (560 KB)

Source

Communications of the ACM archive
Volume 35 , Issue 4 (April 1992) table of contents

Page: 132

Year of Publication: 1992

ISSN:0001-0782

Author

Diane Crawford

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 14, Citation Count: 1

Additional Information:

references cited by index terms

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/129852.376095 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Aho, A.V. In Handbook of theoretical computer science. In press.
	2	R. A. Baeza-Yates, Improved string searching, Software—Practice & Experience, v.19 n.3, p.257-271, March 1989 [doi>10.1002/spe.4380190305]
	3	Ricardo A. Baeza-Yates, String Searching Algorithms Revisited, Proceedings of the Workshop on Algorithms and Data Structures, p.75-96, August 17-19, 1989
	4	Robert S. Boyer , J. Strother Moore, A fast string searching algorithm, Communications of the ACM, v.20 n.10, p.762-772, Oct. 1977 [doi>10.1145/359842.359859]
	5	G Davies , S Bowsher, Algorithms for pattern matching, Software—Practice & Experience, v.16 n.6, p.575-601, June. 1986 [doi>10.1002/spe.4380160608]
	6	Zvi Galil, On improving the worst case running time of the Boyer-Moore string matching algorithm, Communications of the ACM, v.22 n.9, p.505-508, Sept. 1979 [doi>10.1145/359146.359148]
	7	Zvi Galil , Kunsoo Park, An improved algorithm for approximate string matching, SIAM Journal on Computing, v.19 n.6, p.989-999, Dec. 1990 [doi>10.1137/0219067]
	8	Guibas LJ. and Odlyzko, A.M. A new proof of the linearity of the Boyer-Moore string searching algorithm SIAM J. Comp. 9, 4 (1980), 677-682.
	9	Horspool, R.N. Practical fast searching in strings. Software--Praz. and Exp. t O, 3 (1980), 501-506.
	10	Andrew Hume , Daniel Sunday, Fast string searching, Software—Practice & Experience, v.21 n.11, p.1221-1248, Nov. 1991 [doi>10.1002/spe.4380211105]
	11	Knuth, D.E., Morris, Jr., J.H. and Pratt, V.R. Fast pattern matching in strings. SIAM J. Comput. 6, 2 (1977), 323-350.
	12	Kowalski, G. and Meltzer, A. New multi-term high speed text search algorithms. First Int'l Conf. on Comp. Applications, IEEE (June 1984), 514-522.
	13	Landau, G.M., Vishkin U. and Nussinov, R. J. Theor. Biol. 126, (1987), 483-490.
	14	Smit, G.V. A comparison of three string matching algorithms. SoftwareuPrac, and Exp. I2, (1982), 57-66.
	15	P. D. Smith, Experiments with a very fast substring search algorithm, Software—Practice & Experience, v.21 n.10, p.1065-1074, Oct. 1991 [doi>10.1002/spe.4380211006]
	16	Daniel M. Sunday, A very fast substring search algorithm, Communications of the ACM, v.33 n.8, p.132-142, Aug. 1990 [doi>10.1145/79173.79184]
	17	Ziegler, B. An even faster string search algorithm. Bericht 2/1990 Fakult~t Informatik Universit~t, D-7000 Stuttgart 1.