Related Experiment Video
Updated: Oct 9, 2026

Multi-target Parallel Processing Approach for Gene-to-structure Determination of the Influenza Polymerase PB2 Subunit
Published on: June 28, 2013
A multithreaded parallel implementation of a dynamic programming algorithm for sequence comparison
W S Martins1, J B Del Cuvillo, F J Useche
1Department of Electrical and Computer Engineering, University of Delaware, Newark, DE 19716, USA.
Abstract:
This paper discusses the issues involved in implementing a dynamic programming algorithm for biological sequence comparison on a general-purpose parallel computing platform based on a fine-grain event-driven multithreaded program execution model. Fine-grain multithreading permits efficient parallelism exploitation in this application both by taking advantage of asynchronous point-to-point synchronizations and communication with low overheads and by effectively tolerating latency through the overlapping of computation and communication. We have implemented our scheme on EARTH, a fine-grain event-driven multithreaded execution and architecture model which has been ported to a number of parallel machines with off-the-shelf processors. Our experimental results show that the dynamic programming algorithm can be efficiently implemented on EARTH systems with high performance (e.g., speedup of 90 on 120 nodes), good programmability and reasonable cost.
Related Concept Videos
Multiple Comparison Tests
It would be easy to compare two samples using a significance alpha level of 0.05. In other words, there is only one sample pair to be compared. However, it would be difficult to identify a significantly different sample if the number...
Parallel Processing
Comparison Tests
Maxam-Gilbert Sequencing
Challenges of the Maxam-Gilbert Method
The...
Evolutionary Relationships through Genome Comparisons
Convergence of Sequences
