A FAST Pattern Matching Algorithm

Sheik, SS and Aggarwal, Sumit K and Poddar, Anindya and Balakrishnan, N and Sekar, K (2004) A FAST Pattern Matching Algorithm. In: Journal of Chemical Information and Computer Sciences, 44 (4). pp. 1251-1256.

PDF A_FAST.pdf - Published Version Restricted to Registered users only Download (99kB) | Request a copy

Abstract

The advent of digital computers has made the routine use of pattern-matching possible in various applications.This has also stimulated the development of many algorithms. In this paper, we propose a new algorithm that offers improved performance compared to those reported in the literature so far. The new algorithm has been evolved after analyzing the well-known algorithms such as Boyer-Moore, Quick-search, Raita, and Horspool. The overall performance of the proposed algorithm has been improved using the shift provided by the Quick-search bad-character and by defining a fixed order of comparison. These result in the reduction of the character comparison effort at each attempt. The best- and the worst- case time complexities are also presented in this paper. Most importantly, the proposed method has been compared with the other widely used algorithms. It is interesting to note that the new algorithm works consistently better for any alphabet size.

Item Type:	Journal Article
Publication:	Journal of Chemical Information and Computer Sciences
Publisher:	American Chemical Society
Additional Information:	The copyright of this article belongs to American Chemical Society
Department/Centre:	Division of Information Sciences (Doesn't exist now) > BioInformatics Centre
Date Deposited:	27 Oct 2004
Last Modified:	16 Jan 2012 10:21
URI:	http://eprints.iisc.ac.in/id/eprint/2182

Actions (login required)

View Item