论文信息 - Protein and Nucleic Acid Sequence Database Searching: A Suitable Case for Parallel processing

Protein and Nucleic Acid Sequence Database Searching: A Suitable Case for Parallel processing

Sequence analysis of protein and nucleic acid databases by exhaustive string-matching algorithms is effectively implemented on large processor-array machines, such as the I.C.L. DAP. An improved method of assessing the significance of the best alignments for proteins is described. Examples involving the cystic fibrosis antigen and Drosophila vitellogenins illustrate the usefulness of this approach.

[1] Peter H. Sellers,et al. The Theory and Computation of Evolutionary Distances: Pattern Recognition , 1980, J. Algorithms.

[2] J. Berg,et al. Potential metal-binding domains in nucleic acid binding proteins. , 1986, Science.

[3] Veronica van Heyningen,et al. A clue to the basic defect in cystic fibrosis from cloning the CF antigen gene , 1987, Nature.

[4] Temple F. Smith,et al. The statistical distribution of nucleic acid similarities. , 1985, Nucleic acids research.

[5] D. Lipman,et al. Rapid and sensitive protein similarity searches. , 1985, Science.

[6] M S Waterman,et al. Identification of common molecular subsequences. , 1981, Journal of molecular biology.