By Topic

Parallel Hashing-N-Gram-Hirschberg algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Muhannad A. Abu-Hashem ; School of Computer Science, Universiti Sains Malaysia USM, Penang, Malaysia ; Nur'Aini Abdul Rashid ; Rosni Abdullah ; Hesham A. Bahamish

Fast and efficient protein sequence alignment and comparison algorithms have become significance as the size of databases grow very rapidly. This paper introduces a parallel algorithm for Hashing-N-Gram-Hirschberg (HNGH) algorithm. The HNGH algorithm is an extension of N-Gram-Hirschberg (NGH) algorithm which was proposed by Abdul Rashid in 2007. The parallel algorithm is proposed to speed up the sequential HNGH when run on large database. Our parallel algorithm has two levels of parallelization, one on processors level and the other one on the cores level. By testing our previous work with different Gram lengths ranges from 3-6 letters, HNGH algorithm outperforms the former algorithm (NGH algorithm) in most cases. The parallel algorithm shows an enhancement in the execution time but the speed up is a bit low because of the high communication among processers and the high dependency among the tasks.

Published in:

Computer Technology and Development (ICCTD), 2010 2nd International Conference on

Date of Conference:

2-4 Nov. 2010