Article

Fast string matching using an n-gram algorithm

  1. Jong Yong Kim,
  2. John Shawe-Taylor

Article first published online: 30 OCT 2006

DOI: 10.1002/spe.4380240105

Issue

Software: Practice and Experience

Software: Practice and Experience

Volume 24, Issue 1, pages 79–88, January 1994

Additional Information

How to Cite

Kim, J. Y. and Shawe-Taylor, J. (1994), Fast string matching using an n-gram algorithm. Software: Practice and Experience, 24: 79–88. doi: 10.1002/spe.4380240105

Author Information

  1. Department of Computer Science, Royal Holloway and Bedford New College, University of London, Egham, Surrey TW20 OEX, U.K.

Publication History

  1. Issue published online: 30 OCT 2006
  2. Article first published online: 30 OCT 2006
  3. Manuscript Revised: 25 JUN 1993
  4. Manuscript Received: 4 DEC 1991

SEARCH

SEARCH BY CITATION

ARTICLE TOOLS

Get PDF (629K)

Keywords:

  • String searching;
  • Pattern matching;
  • Boyer-Moore algorithm

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.

Get PDF (629K)