.png){kind=icon}
.png){kind=icon}
Return
A sublinear algorithm for two-dimensional string matching
.png){kind=icon}
PRE
AI
DOI：10.1016/0167-8655(96)00055-4.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A simple algorithm based on the Boyer-Moore idea is presented for two-dimensional string matching. The algorithm examines a strip of columns at a time, and the shift of the pattern is based on a string of several characters on a row. The expected running time is shown to be sublinear for random texts and patterns. The algorithm is easy to implement, and it works well in practice.
Keywords:
two-dimensional string matching
Boyer-Moore algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.3
Papers:
7.8K
Citations:
1.6W
Organization
No organization information available