Srikrishnan Divakaran

Fast Algorithms for Exact String Matching

2015 · arXiv (Cornell University)

Given a pattern string $P$ of length $n$ and a query string $T$ of length $m$, where the characters of $P$ and $T$ are drawn from an alphabet of size $Δ$, the {\em exact string …