Parallel Syntenic Alignments
Given two genomic DNA sequences, the syntenic alignment problem is to compute an ordered list of subsequences for each sequence such that the corresponding subsequence pairs exhibit a high degree of similarity. Syntenic alignments are useful in comparing genomic DNA from related species andin identifying conservedgen es. In this paper, we present a parallel algorithm for computing syntenic alignments that runs in O(mn/p) time and O(m + n/p) memory per processor, where m and n are the respective lengths of the two genomic sequences. Our algorithm is time optimal with respect to the corresponding sequential algorithm and can use O(n/log n) processors, where n is the length of the larger sequence. Using an implementation of this parallel algorithm, we report the alignment of human chromosome 12p13 andit s syntenic region in mouse chromosome 6 (both over 220, 000 base pairs in length) in under 24 minutes on a 64-processor IBM xSeries cluster.
KeywordsParallel Algorithm Optimal Alignment Syntenic Region Human Chromosome 12p13 Special Column
Unable to display preview. Download preview PDF.
- S. Aluru, N. Futamura and K. Mehrotra, Biological sequence comparison using prefix computations, Proc. International Parallel Processing Symposium (1999) 653–659. 420Google Scholar
- M.A. Ansari-Lari, J.C. Oeltjen, S. Schwartz, Z. Zhang, D.M. Muzny, J. Lu, J.H. Gorrell, A. C. Chinault, J.W. Belmont, W. Miller and R. A. Gibbs, Comparative sequence analysis of a gene-rich cluster at human chromosome 12p13 and its syntenic region in mouse chromosome 6, Genome Research, 8 (1998) 29–40. 429Google Scholar
- E.W. Edmiston and R.A. Wagner, Parallelization of the dynamic programming algorithm for comparison of sequences, Proc. International Conference on Parallel Processing (1987) 78–80. 420Google Scholar
- X. Huang, A space-efficient algorithm for local similarities, Computer Applications in the Biosciences, 6(4) (1990) 373–381. 420Google Scholar
- X. Huang and K. Chao, A generalized global alignement algorithm, manuscript in preparation. 421Google Scholar
- E. Lander, J.P. Mesirov and W. Taylor, Protein sequence comparison on a data parallel computer, Proc. International Conference on Parallel Processing (1988) 257–263. 420Google Scholar
- E.W. Mayers and W. Miller, Optimal alignments in linear space, Computer Applications in the Biosciences, 4(1) (1988) 11–17. 420Google Scholar