Goad W B, Kanehisa M I
Nucleic Acids Res. 1982 Jan 11;10(1):247-63. doi: 10.1093/nar/10.1.247.
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.
我们提出了一种算法——Needleman-Wunsch-Sellers算法的推广——该算法能在较长序列中找到所有彼此局部相似的子序列。计算仅由偶然因素导致如此相似的概率,并根据统计显著性对这些局部同源性进行分类。还可以找到重复序列和反向重复序列。给出了随机核酸序列和生物核酸序列的结果。对14个完整基因组进行了二元对称性分析。