Pattern recognition in nucleic acid sequences. I. A general method for finding local homologies and symmetries
Open Access
- 1 January 1982
- journal article
- Published by Oxford University Press (OUP) in Nucleic Acids Research
- Vol. 10 (1) , 247-263
- https://doi.org/10.1093/nar/10.1.247
Abstract
We present an algorithm--a generalization of the Needleman-Wunsch-Sellers algorithm--which finds within longer sequences all subsequences that resemble one another locally. The probability that so close a resemblance would occur by chance alone is calculated and used to classify these local homologies according to statistical significance. Repeats and inverted repeats may also be found. Results for both random and biological nucleic acid sequences are presented. Fourteen complete genomes are analyzed for dyad symmetries.Keywords
This publication has 20 references indexed in Scilit:
- Nucleotide sequence of the yeast plasmidNature, 1980
- Coding potential and regulatory signals of the polyoma virus genomeNature, 1980
- BK Virus DNA: Complete Nucleotide Sequence of a Human Tumor VirusScience, 1979
- Nucleotide sequence of the hepatitis B virus genome (subtype ayw) cloned in E. coliNature, 1979
- Pattern recognition in genetic sequencesProceedings of the National Academy of Sciences, 1979
- Complete nucleotide sequence of SV40 DNANature, 1978
- Nucleotide sequence of bacteriophage fd DNANucleic Acids Research, 1978
- Complete nucleotide sequence of bacteriophage MS2 RNA: primary and secondary structure of the replicase geneNature, 1976
- Matching Sequences under Deletion/Insertion ConstraintsProceedings of the National Academy of Sciences, 1972
- Estimation of Secondary Structure in Ribonucleic AcidsNature, 1971