Filtering technique for high speed database sequence comparison

Abstract

Sequence comparison is one of the important database computing applications used in computer science, computational linguistics, social science, biology, etc. This kind of applications processes large database sequences and considered to be high consumers of computation time. Traditional methods apply comparing algorithms on the whole database to find the most matched sequences. We introduce novel and efficient technique to accelerate the sequence comparison by filtering the database to reduce the scope of searching. This will exclude a large number of the database sequences from the searching and will provide the results in reasonable time. Using our filtering technique, we explicitly accelerate the database sequence comparison by 50% in comparison to the traditional known methods.