Huge amounts of data are stored in linear files. This is also the case for biological data. Biological proteins are sequences of amino acids. The quantities of data in these fields tend to increase year on year. For this reason efficient string-matching algorithms should be used which use minimal computer storage and which minimize the searching response time. In this paper, we propose a new algorithm called BRBMH algorithm which offers improved number of comparison and elapsed searching time when compared to the well-known algorithms such as BF, KMP, BM, BMH, KR, ZT, QS, BR, FS, SSABS, TVSBS, ZTBMH and BRFS algorithms. The experimental results show that the new algorithm is faster and perform fewer numbers of comparisons than other compared algorithms for any length of alphabets and patterns. So the proposed algorithm is applicable for searching protein sequence databases as well as in any other string searching applications
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.