Skip to main content
Book Chapter

Parallel string matching algorithms

  • Breslauer D
  • Galil Z
Springer New York, (1993), 121-142
DOI: 10.1007/978-1-4613-9323-8_10
N/ACitations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

… The string matching problem is one of the most studied problems … on parallel algorithms for the string matching problem. … of consecutive matches of u2, we can match the whole pattern. …

Cite

CITATION STYLE

APA

Breslauer, D., & Galil, Z. (1993). Parallel string matching algorithms. In Sequences II (pp. 121–142). Springer New York. https://doi.org/10.1007/978-1-4613-9323-8_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