Abstract
We present efficient algorithms for local alignment search in biological sequences. These algorithms identify maximal segment pairs (MSPs). Our algorithms have the potential of performing better than BLAST (Basic Local Alignment Search Tool) and also are efficiently parallelizable. We employ Fast Fourier Transforms (FFTs). Though several attempts have been made in the past to employ FFTs in sequence analysis, they fail to capture local similarities. Our algorithms employ FFTs in a novel way to identify local similarities. FFT-based techniques have the attractive feature of benefiting from ultrafast special purpose hardware available for digital signal processing.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S.F. Altschul, M.S. Boguski, W. Gish, and J.C. Wootton, “Issues in searching molecular sequence databases,” Nature Genetics, vol. 6, pp. 119-128, 1994.
S.F. Altschul, W. Gish, W. Miller, E.W. Myers, and D.J. Lipman, “Basic local alignment search tool,” Journal of Molecular Biology, vol. 215, pp. 403-410, 1990.
S.F. Altschul, T.L. Madden, A.A. Schäffer, J. Zhang, Z. Zhang, W. Miller, and D.J. Lipman, “Gapped BLAST and PSI-BLAST: A new generation of protein database search programs,” Nucleic Acids Research, vol. 25, no. 17, pp. 3389-3402, 1997.
W.I. Chang and E.L. Lawler, “Approximate string matching in sublinear, expected time,” in Proc. IEEE Symposium on Foundations of Computer Science, 1990, pp. 116-124.
E.A. Cheever, G.C. Overton, and D. Searls, “Fast Fourier Transform-based correlation of DNA sequences using complex plane encoding,” CABIOs, vol. 7, no. 2, pp. 143-154, 1991.
M.O. Dayhoff, R.M. Schwartz, and B.C. Orcutt, “A model of evolutionary change in proteins,” in Atlas of Protein Sequence and Structure, vol. 5, Suppl. 3, M.O. Dayhoff (Eds.), National Biomedical Research Foundation, 1978, pp. 345-352.
E. Horowitz, S. Sahni, and S. Rajasekaran, Computer Algorithms, W.H. Freeman Press, 1998.
J. Já Já, An Introduction to Parallel Algorithms, Addison-Wesley Publishing Company, 1992.
S. Karlin and S. F. Altschul, “Methods for assessing the statistical significance of molecular sequence features by using general scoring schemes,” in Proc. National Academy of Science; USa, vol. 87, 1990, pp. 2264-2268.
S. Karlin, A. Dembo, and T. Kawabata, “Statistical composition of high-scoring segments from molecular se-quences,” The Annals of Statistics, vol. 18, no. 2, pp. 571-581, 1990.
G.M. Landau and U. Vishkin, “Fast parallel and serial approximate string matching,” Journal of Algorithms, vol. 10, pp. 157-169, 1989.
W.R. Pearson and D.J. Lipman, “Improved tools for biological sequence comparison,” in Proc. National Academy of Science; USa, vol. 85, 1988. pp. 2444-2448.
E. Ukkonen, “On approximate string matching,” in Proc. International Conference on Foundations of Computing Theory, Springer-Verlag, vol. 158, 1983, pp. 487-496. LNCS.
M.S. Waterman, “General methods of sequence comparison,” Bulletin of Mathematical Biology, vol. 46, no. 4, pp. 473-500, 1984.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Rajasekaran, S., Nick, H., Pardalos, P. et al. Efficient Algorithms for Local Alignment Search. Journal of Combinatorial Optimization 5, 117–124 (2001). https://doi.org/10.1023/A:1009893719470
Issue Date:
DOI: https://doi.org/10.1023/A:1009893719470