Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. For technical support, please contact us at We apologize for any inconvenience.
By Topic

A performance evaluation of a local DNA sequence alignment algorithm on a cluster of workstations

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
$31 $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

6 Author(s)

Summary form only given. Biological inspired techniques have proven to be efficient in solving a variety of real problems using parallel and distributed processing. In this paper, we wish to study the DNA sequencing problem known for its computational requirements which far exceed the computing capabilities of the fastest available sequential machines. Sequence comparison is a basic operation of the DNA sequencing problem, mainly due to the large number of DNA sequences. While most of the methods used are based on heuristic paradigms and have relatively a fast execution time, they do not produce optimal alignments sought by most biologists. Recently, many organisms had their DNA entirely sequenced, and this reality presents the need for comparing long DNA sequences, which is a challenging task due to its high demands for computational requirements (power and memory). In this paper, we present an efficient parallel strategy for implementing a sequence alignment algorithm for long sequences, and evaluate its performance using a cluster of workstations. This strategy was implemented in JIAJIA, a scope consistent software DSM system. Our results indicate clearly that our scheme is feasible, achieve a good speedup and can help in obtaining a better solution to the DNA sequencing problem when compared to previous schemes.

Published in:

Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International

Date of Conference:

26-30 April 2004