RSMA matching algorithm for searching biological sequences

Ahmad Fadel Klaib, Hugh Osborne

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Huge amounts of biological data are stored in linear files. Biological proteins are sequences of amino acids. The quantities of data in these fields tend to increase year on year. String matching algorithms playa key role in many computer science problems, and in the implementation of computer software. For this reason efficient string-matching algorithms should be used which use minimal computer storage and which minimize the searching response time. In this study, we propose a new algorithm called the Random String Matching Algorithm (RSMA). RSMA combines our enhanced preprocessing phase from the Berry Ravindran algorithm with our proposed new searching phase procedure. This variety ofsearching order allows our proposed algorithm to reduce the number of comparison characters and enhances the searching response time. Experimental results show that the RSMA algorithm offers a smaller number of comparisons and offers improved elapsed searching time when compared to other well-known algorithms.

Original languageEnglish
Title of host publication2009 International Conference on Innovations in Information Technology, IIT '09
Pages195-199
Number of pages5
DOIs
Publication statusPublished - 2009
EventInternational Conference on Innovations in Information Technology - Al-Ain, United Arab Emirates
Duration: 15 Dec 200917 Dec 2009

Conference

ConferenceInternational Conference on Innovations in Information Technology
Abbreviated titleIIT '09
CountryUnited Arab Emirates
CityAl-Ain
Period15/12/0917/12/09

    Fingerprint

Cite this

Klaib, A. F., & Osborne, H. (2009). RSMA matching algorithm for searching biological sequences. In 2009 International Conference on Innovations in Information Technology, IIT '09 (pp. 195-199). [5413769] https://doi.org/10.1109/IIT.2009.5413769