Ultrafast Genomic Database Search using Layered Locality Sensitive Hashing

In this article, we will demonstrate Layered Locality Sensitive Hashing in genomic sequence comparison. Locality Sensitive Hashing based algorithms have already been proved to be successful for approximate nearest neighbor search in high dimensional data. Genomic database search is the primary task for homology detection and motif identification. However, the huge genome size and unknown repetitive regions make the task even more difficult. To tackle this problem we have introduced layered locality sensitive hashing for large scale genomic comparisons. As it turns out, the proposed method reduces the search time by 93.6%, while producing results almost as good as the exact ones.