Skip to main content
Conference Proceedings

A string matching algorithm fast on the average

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1979) 71 LNCS 118-132
DOI: 10.1007/3-540-09510-1_10
245Citations
Citations of this article
35Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Commentz-Walter, B. (1979). A string matching algorithm fast on the average. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 71 LNCS, pp. 118–132). Springer Verlag. https://doi.org/10.1007/3-540-09510-1_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free