Pattern recognition in nucleic acid sequences. I. A general method for finding local homologies and symmetries.
AUTOR(ES)
Goad, W B
RESUMO
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.
ACESSO AO ARTIGO
http://www.pubmedcentral.nih.gov/articlerender.fcgi?artid=326131Documentos Relacionados
- Pattern recognition in nucleic acid sequences. II. An efficient method for finding locally stable secondary structures.
- Use of statistical criteria for screening potential homologies in nucleic acid sequences.
- An efficient method for matching nucleic acid sequences.
- Search algorithm for pattern match analysis of nucleic acid sequences.
- An efficient method for finding repeats in molecular sequences.