article · University of Huddersfield Repository (University of Huddersfield) · 2008

Searching protein sequence databases using BRBMH matching algorithm

Cited by 2Abstract and details only

Abstract

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.

Cite this paper

APA 7

Klaib, A. F., & Osborne, H. (2008). Searching protein sequence databases using BRBMH matching algorithm. University of Huddersfield Repository (University of Huddersfield).

MLA 9

Klaib, Ahmad F., and Hugh Osborne. “Searching protein sequence databases using BRBMH matching algorithm.” University of Huddersfield Repository (University of Huddersfield), 2008.

Chicago

Klaib, Ahmad F., and Hugh Osborne. 2008. “Searching protein sequence databases using BRBMH matching algorithm.” University of Huddersfield Repository (University of Huddersfield).

Harvard

Klaib, A.F. and Osborne, H. (2008) ‘Searching protein sequence databases using BRBMH matching algorithm’, University of Huddersfield Repository (University of Huddersfield).

BibTeX

@article{klaib2008searching,
  title = {{Searching protein sequence databases using BRBMH matching algorithm}},
  author = {Klaib, Ahmad F. and Osborne, Hugh},
  journal = {University of Huddersfield Repository (University of Huddersfield)},
  year = {2008}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.