Parallel processing of biological sequence comparison algorithms
International Journal of Parallel Programming
A space-efficient parallel sequence comparison algorithm for a message-passing multiprocessor
International Journal of Parallel Programming
String editing on an SIMD hypercube multicomputer
Journal of Parallel and Distributed Computing
Efficient parallel algorithms for string editing and related problems
SIAM Journal on Computing
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
A linear space algorithm for computing maximal common subsequences
Communications of the ACM
Space and Time Optimal Parallel Sequence Alignments
IEEE Transactions on Parallel and Distributed Systems
A Million-Fold Speed Improvement in Genomic Repeats Detection
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
Faster optimal parallel prefix circuits: New algorithmic construction
Journal of Parallel and Distributed Computing
A parallel strategy for biological sequence alignment in restricted memory space
Journal of Parallel and Distributed Computing
Computation-efficient parallel prefix
AIC'06 Proceedings of the 6th WSEAS International Conference on Applied Informatics and Communications
Two families of parallel prefix algorithms for multicomputers
TELE-INFO'08 Proceedings of the 7th WSEAS International Conference on Telecommunications and Informatics
Straightforward construction of depth-size optimal, parallel prefix circuits with fan-out 2
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Parallel prefix algorithms on the multicomputer
WSEAS Transactions on Computer Research
Fast problem-size-independent parallel prefix circuits
Journal of Parallel and Distributed Computing
New parallel prefix algorithms
AIC'09 Proceedings of the 9th WSEAS international conference on Applied informatics and communications
New families of computation-efficient parallel prefix algorithms
WSEAS Transactions on Computers
Hardware-Accelerated RNA Secondary-Structure Alignment
ACM Transactions on Reconfigurable Technology and Systems (TRETS)
Fast scalable algorithm on LARPBS for sequence alignment
ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications
Parallel sequence alignment: a lookahead approach
PReMI'05 Proceedings of the First international conference on Pattern Recognition and Machine Intelligence
Parallelizing dynamic programming through rank convergence
Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming
| Hi-index | 0.00 |
We present practical parallel algorithms using prefix computations for various problems that arise in pairwise comparison of biological sequences. We consider both constant and affine gap penalty functions, full-sequence and subsequence matching, and space-saving algorithms. Commonly used sequential algorithms solve the sequence comparison problems in O(mn) time and O(m + n) space, where m and n are the lengths of the sequences being compared. All the algorithms presented in this paper are time optimal with respect to the sequential algorithms and can use O(n/log n) processors where n is the length of the larger sequence. While optimal parallel algorithms for many of these problems are known, we use a simple framework and demonstrate how these problems can be solved systematically using repeated parallel prefix operations. We also present a space-saving algorithm that uses O(m + n/p) space and runs in optimal time where p is the number of the processors used. We implemented the parallel space-saving algorithm and provide experimental results on an IBM SP-2 and a Pentium cluster.