A Fast Hybrid Algorithm Approach for the Exact String Matching Problem Via Berry Ravindran and Alpha Skip Search Algorithms

Almazroi Almazroi

doi:10.3844/jcssp.2011.644.650

Abstract

Problem statement: String matching algorithm had been an essential means for searching biological sequence database. With the constant expansion in scientific data such as DNA and Protein; the development of enhanced algorithms have even become more critical as the major concern had always been how to raise the performances of these search algorithms to meet challenges of scientific information. Approach: Therefore a new hybrid algorithm comprising Berry Ravindran (BR) and Alpha Skip Search (ASS) is presented. The concept is based on BR shift function and combines with ASS to ensure improved performance. Results: The results obtained in percentages from the proposed hybrid algorithm displayed superior results in terms of number of attempts and number of character comparisons than the original algorithms when various types of data namely DNA, Protein and English text are applied to appraise the hybrid performances. The enhancement of the proposed hybrid algorithm performs better at 71%, 60% and 63% when compared to Berry-Ravindran in DNA, Protein and English text correspondingly. Moreover the rate of enhancement over Alpha Skip Search algorithm in DNA, Protein and English text are 48%, 28% and 36% respectively. Conclusion: The new proposed hybrid algorithm is relevant for searching biological science sequence database and also other string search systems.

Highlights

In modern times string search algorithms continues to play a vital role for searching string applications (Almazroi and Rashid, 2011) searching and matching patterns from vast and multifaceted science data
The search for improved hybrids performance (Pratumsuwan et al, 2010) are leading to the development of new search algorithms, in this study a new hybrid algorithm consisting of Alpha Skip Search (ASS) and Berry-Ravindran (BR) algorithms is proposed and the aim is to extract the best features from each algorithm and combine them to enhance the performance of the new hybrid algorithm
The ASSBR display efficient searching performance and this is due to the verifications which are carry out at every starting spot in every attempt, that in tend leads to best shift value when compared with the original algorithms, enabling the weaknesses to be overcome by the hybrid and these benefits are used in the searching phase to boost results

Summary

Introduction

In modern times string search algorithms continues to play a vital role for searching string applications (Almazroi and Rashid, 2011) searching and matching patterns from vast and multifaceted science data. The goodness of algorithms are measured in terms of number of character comparisons and number of attempts and to ensure bigger shift values (Huang et al, 2008a) to boost performance. The pre-processing phase presented by BR algorithm is the best as it ensures greater shift values. In the case of ASS algorithm searching phase, it is best known for searching strings. The ASSBR display efficient searching performance and this is due to the verifications which are carry out at every starting spot in every attempt, that in tend leads to best shift value when compared with the original algorithms, enabling the weaknesses to be overcome by the hybrid and these benefits are used in the searching phase to boost results

Methods

Results

Conclusion