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
Parallel programming with MPI
A linear space algorithm for computing maximal common subsequences
Communications of the ACM
Parallel dynamic programming for solving the string editing problem on a CGM/BSP
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Introduction to Parallel Computing
Introduction to Parallel Computing
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
Parallel biological sequence comparison using prefix computations
Journal of Parallel and Distributed Computing
Streaming Algorithms for Biological Sequence Alignment on GPUs
IEEE Transactions on Parallel and Distributed Systems
A parallel strategy for biological sequence alignment in restricted memory space
Journal of Parallel and Distributed Computing
Extending the Four Russian Algorithm to Compute the Edit Script in Linear Space
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
Harnessing parallelism in multicore clusters with the all-pairs and wavefront abstractions
Proceedings of the 18th ACM international symposium on High performance distributed computing
CUDAlign: using GPU to accelerate the comparison of megabase genomic sequences
Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
BSB'07 Proceedings of the 2nd Brazilian conference on Advances in bioinformatics and computational biology
Hardware accelerated sequence alignment with traceback
International Journal of Reconfigurable Computing - Special issue on selected papers from ReConFig 2008
A hybrid HMM/DPA adaptive gesture recognition method
ISVC'05 Proceedings of the First international conference on Advances in Visual Computing
International Journal of Computational Science and Engineering
Hi-index | 0.00 |
We present the first space and time optimal parallel algorithm for the pairwise sequence alignment problem, a fundamental problem in computational biology. This problem can be solved sequentially inO(mn) time andO(m+n) space, wherem andn are the lengths of the sequences to be aligned. The fastest known parallel space-optimal algorithm for pairwise sequence alignment takes optimalO\left({{m+n}\over{p}}\right) space, but suboptimalO\left({{(m+n)^2}\over{p}}\right) time, wherep is the number of processors. On the other hand, the most space economical time-optimal parallel algorithm takesO\left({{mn}\over{p}}\right) time, butO\left(m+{{n}\over{p}}\right) space. We close this gap by presenting an algorithm that achieves both time and space optimality, i.e. requires onlyO\left({{m+n}\over{p}}\right) space andO\left({{mn}\over{p}}\right) time. We also present an experimental evaluation of the proposed algorithm on an IBM xSeries cluster. Although presented in the context of full sequence alignments, our algorithm is applicable to other alignment problems in computational biology including local alignments and syntenic alignments. It is also a useful addition to the range of techniques available for parallel dynamic programming.