This website uses cookies.
We use cookies to improve your online experience. By continuing to use our website we assume you agree to the placement of these cookies.
To learn more, you can find in our Privacy Policy.
Other

Efficient randomized pattern-matching algorithms

Volume: 31, Issue: 2, Pages: 249 - 260
Published: Mar 1, 1987
Abstract
We present randomized algorithms to solve the following string-matching problem and some of its generalizations: Given a string X of length n (the pattern) and a string Y (the text), find the first occurrence of X as a consecutive block within Y. The algorithms represent strings of length n by much shorter strings called fingerprints, and achieve their efficiency by manipulating fingerprints instead of longer strings. The algorithms require a...
Paper Details
Title
Efficient randomized pattern-matching algorithms
Published Date
Mar 1, 1987
Volume
31
Issue
2
Pages
249 - 260
Citation AnalysisPro
  • Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
  • Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.
Step 1. Scroll down for details & analytics related to the paper.
Discover a range of citation analytics, paper references, a list of cited papers, and more.