论文信息 - Smith–Waterman Algorithm - 字舞流文

Smith–Waterman Algorithm

The Smith–Waterman algorithm is a computer algorithm that finds regions of local similarity between DNA or protein sequences. Keywords: DNA; protein; sequence alignment

[1] O. Gotoh. An improved algorithm for matching biological sequences. , 1982, Journal of molecular biology.

[2] S. B. Needleman,et al. A general method applicable to the search for similarities in the amino acid sequence of two proteins. , 1970, Journal of molecular biology.

[3] Michael S. Waterman,et al. Introduction to computational biology , 1995 .

[4] Ömer Egecioglu,et al. A new approach to sequence comparison: normalized sequence alignment , 2001, Bioinform..

[5] Peter H. Sellers,et al. An Algorithm for the Distance Between Two Finite Sequences , 1974, J. Comb. Theory, Ser. A.

[6] B. Berger,et al. Human and Mouse Gene Structure: Comparative Analysis and Application to Exon Prediction , 2000 .

[7] G. Rubin,et al. A computer program for aligning a cDNA sequence with a genomic DNA sequence. , 1998, Genome research.

[8] Richard Mott. Local sequence alignments with monotonic gap penalties , 1999, Bioinform..

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