Nussinov R
J Mol Evol. 1983;19(3-4):283-5. doi: 10.1007/BF02099975.
There are several algorithms designed for searches for homologous sequences (Fitch 1966; Needleman and Wunsch 1970; Chva'tal and Sankoff 1975; Griggs 1977; Sannkoff 1972; Smith and Waterman 1981; Smith et al. 1981, Wagner and Fischer 1974; Waterman et al. 1976). This paper presents some very simple and useful high speed, "text editing" algorithms that search for exact nucleotide sequence repetition and genome duplication. The last algorithm suggested here is specifically adapted for the 4-letter alphabet of nucleotide sequences. Owing to the rapid accumulation of nucleotide sequences and the frequent need to search for sequence repetition or where a given set of nucleotides occurs in long sequences, efficient algorithms of this type are a necessity.
有几种用于搜索同源序列的算法(菲奇,1966年;尼德尔曼和温施,1970年;奇瓦尔和桑科夫,1975年;格里格斯,1977年;桑科夫,1972年;史密斯和沃特曼,1981年;史密斯等人,1981年;瓦格纳和菲舍尔,1974年;沃特曼等人,1976年)。本文提出了一些非常简单且有用的高速“文本编辑”算法,用于搜索精确的核苷酸序列重复和基因组复制。这里提出的最后一种算法是专门针对核苷酸序列的四字母字母表设计的。由于核苷酸序列的快速积累以及经常需要搜索序列重复或给定的一组核苷酸在长序列中的出现位置,这种高效算法是必要的。