Klaib, Ahmad and Osborne, Hugh (2009) BRQS Matching Algorithm for Searching Protein Sequence Databases. In: Future Computer and Communication, 2009. ICFCC 2009. International Conference on. IEEE, London, UK, pp. 223-226. ISBN 978-0-7695-3591-3Metadata only available from this repository.
String matching algorithms play a key role in many computer science problems, challenges and in the implementation of computer software. This problem has received a great deal of attention due to various applications in computational biology. In our study, we propose a new algorithm called BRQS. Experimental results show that it offers fewer numbers of comparisons and offers improved elapsed searching time when compared to other well-known algorithms for searching any length of alphabets and patterns. The proposed algorithm is applicable to search protein sequence databases as well as any other string searching applications.
|Item Type:||Book Chapter|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
Q Science > QA Mathematics > QA76 Computer software
|Schools:||School of Computing and Engineering|
School of Computing and Engineering > Pedagogical Research Group
?? tserg ??
|Depositing User:||Sara Taylor|
|Date Deposited:||08 Mar 2011 16:12|
|Last Modified:||08 Mar 2011 16:12|
Repository Staff Only: item control page