Search domain elimination of genomic databases using a new percentage approximation technique

Search tools for genomic databases have an important role in the development of biotechnology and relevant areas. The Smith and Waterman algorithm (SW) is probably the best precision algorithm for searching genomic databases even though it consumes a great amount of computer power for processing. This paper proposes a new method, which can be attached to SW in order to increase its speed and simultaneously maintain its best accuracy. This approach endeavours to significantly improve the performance of search algorithms in terms of speed and precision. According to the experiment, the PA module can reduce the process time and search domain of SW by 7 to 15 percent and maintain 100 percent accuracy of the original algorithm.