Pattern recognition in nucleic acid sequences. I. A general method for finding local homologies and symmetries

摘要: 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 so close a resemblance would occur by chance alone is calculated and used to classify these local homologies according statistical significance. Repeats inverted repeats may also be found. Results for both random biological nucleic acid are presented. Fourteen complete genomes analyzed dyad symmetries.