Abstract:

The significant growth in biological data has driven computer scientists to create fast, efficient and accurate algorithms for searching databases at the fastest possible search responses, in order to assist the biologists to retrieve the existing information quickly from any biological database. Furthermore, the trends in parallel programming models have also encouraged the computer researchers to improve the searching approaches to cope with this exponential increase. This research provides a comprehensive summary of some searching methods, as well as the state-of-the-art for the Parallel Boyer-Moore-Quick Search Algorithm (P-BM-QS). The results of the literature review show that the hybrid technique of P-BM-QS will improve the searching speedup in comparison with one direction algorithms. It could be concluded from the literature review that the proposed P-BM-QS is appropriate for large data sets, in terms of searching time.