Abstract
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.
Research supported by NSF Career under CCR-0096288 andN SF EIA-0130861.
Research supported by NIH Grants R01 HG01502-05 andR 01 HG01676-05 from NHGRI.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
S. Aluru, N. Futamura and K. Mehrotra, Biological sequence comparison using prefix computations, Proc. International Parallel Processing Symposium (1999) 653–659. 420
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. 429
S. Batzoglou, L. Pachter, J. P. Mesirov, B. Berger and E. S. Lander, Human and mouse gene structure: comparative analysis andap plication to exon prediction, Genome Research, 10 (2000) 950–958. 421
A.L. Delcher, S. Kasif, R.D. Fleischmann, J. Peterson, O. While and S.L. Salzberg, Alignment of whole genomes. Nucleic Acids Research, 27 (1999) 2369–2376. 421
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. 420
E.W. Edmiston, N.G. Core, J. H. Saltz and R.M. Smith, Parallel processing of biological sequence comparison algorithms, International Journal of Parallel Programming, 17(3) (1988) 259–275. 420
O. Gotoh, An improvedalgorit hm for matching biological sequences. Journal of Molecular Biology, 162 (1982) 705–708. 420
D. S. Hirschberg, A linear space algorithm for computing maximal common subsequences, Communications of the ACM, 18(6) (1975) 341–343. 423
X. Huang, A space-efficient parallel sequence comparison algorithm for a messagepassing multiprocessor, International Journal of Parallel Programming, 18(3) (1989) 223–239. 420
X. Huang, A space-efficient algorithm for local similarities, Computer Applications in the Biosciences, 6(4) (1990) 373–381. 420
X. Huang and K. Chao, A generalized global alignement algorithm, manuscript in preparation. 421
N. Jareborg, E. Birney, and R. Durbin, Comparative analysis of noncoding regions of 77 orthologous mouse andh uman gene pairs, Genome Research, 9, (1999) 815–824. 421
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. 420
E.W. Mayers and W. Miller, Optimal alignments in linear space, Computer Applications in the Biosciences, 4(1) (1988) 11–17. 420
S.B. Needleman and C. D. Wunsch, A general method applicable to the search for similarities in the amino acidseq uence of two proteins, Journal of Molecular Biology, 48 (1970) 443–453. 420
S. Schwartz, Z. Zhang, K. Frazer, A. Smit, C. Riemer, J. Bouck, R. Gibbs, R. Hardison, and W. Miller, PipMaker-A web server for aligning two genomic DNA sequences, Genome Research, 10 (2000) 577–586. 421
T. F. Smith and M. S. Waterman, Identification of common molecular subsequences, Journal of Molecular Biology, 147 (1981) 195–197. 420
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Futamura, N., Aluru, S., Huang, X. (2002). Parallel Syntenic Alignments. In: Sahni, S., Prasanna, V.K., Shukla, U. (eds) High Performance Computing — HiPC 2002. HiPC 2002. Lecture Notes in Computer Science, vol 2552. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36265-7_40
Download citation
DOI: https://doi.org/10.1007/3-540-36265-7_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00303-8
Online ISBN: 978-3-540-36265-4
eBook Packages: Springer Book Archive