CONSTRUCTION OF THE FULL LOCAL SIMILARITY MAP FOR 2 BIOPOLYMERS
CONSTRUCTION OF THE FULL LOCAL SIMILARITY MAP FOR 2 BIOPOLYMERS
复制标题
DOI：
10.1016/0303-2647(93)90062-h
复制
发表时间：
1993-01-01
期刊：
影响因子：
1.6
通讯作者：
GORBALENYA, AE
中科院分区：
文献类型：
--
作者：
LEONTOVICH, AM;BRODSKY, LI;GORBALENYA, AE
描述了一种用于构建两个生物聚合物序列的完整局部相似图的新算法。该算法比相关的Altschul-Erickson过程快得多。它被实现为GeneBee包中的Dot-Helix模块。通过对两个3型脊髓灰质炎病毒株多蛋白的分析，验证了该算法的有效性，并与Staden方法进行了比较。简要讨论了该算法的可能应用。
A novel algorithm for construction of complete maps of local similarity for two biopolymer sequences is described. The algorithm is much faster than the related Altschul-Erickson procedure. it is implemented as the Dot-Helix module within the GeneBee package. Performance of the algorithm is exemplified with the analysis of the polyproteins of two poliovirus type 3 strains and its effectivity is compared to the Staden method. Possible applications of the algorithm are briefly discussed.