Abstract
As the volume of protein sequence data grows, rapid methods for searching the protein sequence database become of primary importance. Rigorous comparison of sequences is obtained with the well-known dynamic programming algorithms. However, these algorithms are not rapid enough to use for routinely searching the entire database. In this paper we discuss some methods that can be used for rapid searches.
Similar content being viewed by others
Literature
Aho, A. V. and M. J. Corasick. 1975. “Efficient String Matching: An Aid to Bibliographic Search.”Communs. Ass. Comput. Mach. 18, 333–340.
Boyer, R. S. and J. S. Moore. 1977. “A Fast String Searching Algorithm.”Comm. ACM. 20, 762–772.
Dayhoff, M. O., R. M. Schwartz and B. C. Orcutt. 1979. “A Model of Evolutionary Change in Proteins.” InAtlas of Protein Sequence and Structure, Ed. M. O. Dayhoff. Vol. 5, Suppl. 3, pp. 345–352. National Biomedical Research Foundation, Washington DC., U.S.A.
Fitch, W. M. and T. F. Smith. 1983. “Optimal Sequence Alignments.”Proc. natn. Acad. Sci. U.S.A. 80, 1382–1386.
Gotoh, O. 1982. “An Improved Algorithm for Matching Biological Sequences.”J. molec. Biol. 162, 705–708.
Hall, P. A. V. and G. R. Dowling. 1980. “Approximate String Matching.”Comput. Surv. 12, 381–402.
Knuth, D. E., J. H. Morris, Jr. and V. R. Pratt. 1977. “Fast Pattern Matching in Strings.”SIAM J. Comput. 6, 323–350.
Kruskal, J. B. 1983. “An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules.”SIAM Rev. 25, 201–237.
Lowrance, R. and R. A. Wagner. 1975. “An Extension of the String-to-String Correction Problem.”J. ACM. 22, 177–183.
Needleman, S. B. and C. D. Wunsch. 1970. “A General Method Applicable to the Search for Similarities in the Amino Acid Sequence of Two Proteins”.J. molec. Biol. 48, 443–453.
Peltola, H., H. Soderlund and E. Ukkonen. 1984. “SEQUAID: A DNA Sequence Assembling Program Based on a Mathematical Model.”Nucl. Acids Res. 12, 307–321.
Sankoff, D. and J. B. Kruskal (Eds) 1983.Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. Reading, Massachussetts: Addison-Wesley.
Sellers, P. H. 1974. “On the Theory and Computation of Evolutionary Distances.”SIAM J. appl. Math. 26, 787–793.
Smith, T. F., M. S. Waterman and W. M. Fitch. 1981. “Comparative Biosequence Metrics.”J. molec. Evol. 18, 38–46.
Wagner, R. A. and M. J. Fischer. 1974. “The String-to-String Correction Problem.”J. ACM. 21, 168–173.
Waterman, M. S., T. F. Smith and W. A. Beyer. 1976. “Some Biological Sequence Metrics.”Adv. Math. 20, 367–387.
Wilbur, W. J. and D. J. Lipman. 1983. “Rapid Similarity Searches of Nucleic Acid and Protein Data Banks.”Proc. natn. Acad. Sci. U.S.A. 80, 726–730.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Orcutt, B.C., Barker, W.C. Searching the protein sequence database. Bltn Mathcal Biology 46, 545–552 (1984). https://doi.org/10.1007/BF02459502
Issue Date:
DOI: https://doi.org/10.1007/BF02459502