A Domain Decomposition Strategy for Alignment of Multiple Biological Sequences on Multiprocessor Platforms
Preprint
Abstract
Multiple Sequences Alignment (MSA) of biological sequences is a fundamental problem in computational biology due to its critical significance in wide ranging applications including haplotype reconstruction, sequence homology, phylogenetic analysis, and prediction of evolutionary origins. The MSA problem is considered NP-hard and known heuristics for the problem do not scale well with increasing number of sequences. On the other hand, with the advent of new breed of fast sequencing techniques it is now possible to generate thousands of sequences very quickly. For rapid sequence analysis, it is therefore desirable to develop fast MSA algorithms that scale well with the increase in the dataset size. In this paper, we present a novel domain decomposition based technique to solve the MSA problem on multiprocessing platforms. The domain decomposition based technique, in addition to yielding better quality, gives enormous advantage in terms of execution time and memory requirements. The proposed strategy allows to decrease the time complexity of any known heuristic of O(N)^x complexity by a factor of O(1/p)^x, where N is the number of sequences, x depends on the underlying heuristic approach, and p is the number of processing nodes. In particular, we propose a highly scalable algorithm, Sample-Align-D, for aligning biological sequences using Muscle system as the underlying heuristic. The proposed algorithm has been implemented on a cluster of workstations using MPI library. Experimental results for different problem sizes are analyzed in terms of quality of alignment, execution time and speed-up.Keywords
All Related Versions
This publication has 27 references indexed in Scilit:
- Multiple Sequence Alignment System for Pyrosequencing Reads2009
- A Polynomial Time Solvable Formulation of Multiple Sequence AlignmentJournal of Computational Biology, 2006
- Quality assessment of multiple alignment programsFEBS Letters, 2002
- Predicting reliable regions in protein sequence alignmentsBioinformatics, 2002
- Large-scale comparison of protein sequence alignment algorithms with structure alignmentsProteins: Structure, Function, and Bioinformatics, 2000
- BAliBASE: a benchmark alignment database for the evaluation of multiple alignment programs.Bioinformatics, 1999
- Rose: generating sequence families.Bioinformatics, 1998
- C3: A Parallel Model for Coarse-Grained MachinesJournal of Parallel and Distributed Computing, 1996
- Communication operations on coarse-grained mesh architecturesParallel Computing, 1995
- Identification of common molecular subsequencesJournal of Molecular Biology, 1981