Perfect Hashing Structures for Parallel Similarity Searches - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Perfect Hashing Structures for Parallel Similarity Searches

(1) , (2, 3) , (3, 2)


Seed-based heuristics have proved to be efficient for studying similarity between genetic databases with billions of base pairs. This paper focuses on algorithms and data structures for the filtering phase in seed-based heuristics, with an emphasis on efficient parallel GPU/manycores implementa- tion. We propose a 2-stage index structure which is based on neighborhood indexing and perfect hashing techniques. This structure performs a filtering phase over the neighborhood regions around the seeds in constant time and avoid as much as possible random memory accesses and branch divergences. Moreover, it fits particularly well on parallel SIMD processors, because it requires intensive but homogeneous computational operations. Using this data structure, we developed a fast and sensitive OpenCL prototype read mapper.

Dates et versions

hal-01153893 , version 1 (20-05-2015)



Tuan Tu Tran, Mathieu Giraud, Jean-Stéphane Varré. Perfect Hashing Structures for Parallel Similarity Searches. International Workshop on High Performance Computational Biology (HiCOMB 2015) / International Parallel and Distributed Processing Symposium (IPDPS 2015), 2015, Hyderabad, India. pp.332-341, ⟨10.1109/IPDPSW.2015.105⟩. ⟨hal-01153893⟩
378 Consultations
0 Téléchargements



Gmail Facebook Twitter LinkedIn More