Other
Efficient randomized pattern-matching algorithms
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
TrendsPro
You’ll need to upgrade your plan to Pro
Looking to understand a paper’s academic impact over time?
- Scinapse’s Citation Trends graph enables the impact assessment of papers in adjacent fields.
- Assess paper quality within the same journal or volume, irrespective of the year or field, and track the changes in the attention a paper received over time.
Citation AnalysisPro
You’ll need to upgrade your plan to Pro
Looking to understand the true influence of a researcher’s work across journals & affiliations?
- 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.