Department of Computer Science & Engineering, Faculty of Engineering and Technology, NSHM Knowledge Campus, Durgapur 713212, India.
Biomed Res Int. 2013;2013:372646. doi: 10.1155/2013/372646. Epub 2013 Aug 13.
We design an Algorithm for bioengine. As a program are enable optimal alignments searching between two sequences, the host sequence (normal plant) as well as query sequence (virus). Searching for homologues has become a routine operation of biological sequences in 4 × 4 combination with different subsequence (word size). This program takes the advantage of the high degree of homology between such sequences to construct an alignment of the matching regions. There is a main aim which is to detect the overlapping reading frames. This program also enables to find out the highly infected colones selection highest matching region with minimum gap or mismatch zones and unique virus colones matches. This is a small, portable, interactive, front-end program intended to be used to find out the regions of matching between host sequence and query subsequences. All the operations are carried out in fraction of seconds, depending on the required task and on the sequence length.
我们设计了一种用于生物工程的算法。作为一个程序，它能够在两个序列之间进行最佳对齐搜索，一个是宿主序列（正常植物），另一个是查询序列（病毒）。在 4×4 的不同子序列（字长）组合中搜索同源物已经成为生物序列的常规操作。该程序利用这些序列之间的高度同源性来构建匹配区域的对齐。其主要目的是检测重叠的阅读框。该程序还能够找到高度感染的克隆选择具有最小间隙或错配区域的最高匹配区域，以及独特的病毒克隆匹配。这是一个小型、可移植、交互式的前端程序，旨在用于查找宿主序列和查询子序列之间的匹配区域。所有操作都在几分之一秒内完成，具体取决于所需的任务和序列长度。
