- Conference Article
5
- 10.1109/icpp.2003.1240564
Space and time optimal parallel sequence alignments
- Jan 01, 2003
- S Rajko + 1 more +1
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 in O(mn) time and O(m+n) space, where m and n are the lengths of the sequences to be aligned. The fastest known parallel space-optimal algorithm for pairwise sequence alignment takes optimal O(m+n/p) space but suboptimal O((m+n) <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> /p) time, where p is the number of processors. On the other hand, the most space economical time-optimal parallel algorithm takes O(mn/p) time but O(m+n/p) space. We close this gap by presenting an algorithm that achieves both time and space optimality, i.e. requires only O(m+n/p) space and O(mn/p) time. We also present an experimental evaluation of the proposed algorithm on an IBMxSeries cluster
Read more