Randomized and parallel algorithms for distance matrix calculations in multiple sequence alignment.
Multiple sequence alignment (MSA) is a vital problem in biology. Optimal alignment of multiple sequences becomes impractical even for a modest number of sequences since the general version of the problem is NP-hard. Because of the high time complexity of traditional MSA algorithms, even today's fast computers are not able to solve the problem for large number of sequences. In this paper we present a randomized algorithm to calculate distance matrices, which is a major step in many multiple sequence alignment algorithms. The basic idea employed is sampling (along the lines of). We also illustrate how to parallelize this algorithm. In Section we introduce the problem of multiple sequence alignments. In Section we provide a discussion on various methods that have been employed in the literature for Multiple Sequence Alignment. In this section we also introduce our new sampling approach. We extend our randomized algorithm to the case of non-uniform length sequences as well. We show that our algorithms are amenable to parallelism in Section. In Section we back up our claim of speedup and accuracy with empirical data and examples. In Section we provide some concluding remarks.
Rajasekaran
Sanguthevar
S
School of Computer Science and Engineering, Harvard University, Boston, MA, USA. rajasek@engr.uconn.edu
Thapar
Vishal
V
Dave
Hardik
H
Huang
Chun-Hsi
CH
D000465:Algorithms; D019295:Computational Biology; D003205:Computing Methodologies; D016415:Sequence Alignment; D017422:Sequence Analysis, DNA; D020539:Sequence Analysis, Protein