Fast string matching using an n-gram algorithm |
| |
Authors: | Jong Yong Kim John Shawe-Taylor |
| |
Abstract: | Experimental results are given for the application of a new n-gram algorithm to substring searching in DNA strings. The results confirm theoretical predictions of expected running times based on the assumption that the data are drawn from a stationary ergodic source. They also confirm that the algorithms tested are the most efficient known for searches involving larger patterns. |
| |
Keywords: | String searching Pattern matching Boyer-Moore algorithm |
|