Raghava G P, Sahni G
Institute of Microbial Technology, Chandigarh, India.
Biotechniques. 1994 Jun;16(6):1116-23.
A computer program called GMAP has been developed for i) mapping the potential restriction endonuclease (R.E.) sites that can be introduced in a nonambiguous DNA sequence; ii) predicting the mutations required to introduce unique R.E. sites in the nonambiguous DNA sequences; and iii) searching all R.E. sites in ambiguous DNA sequence obtained by reverse translation of a given amino acid sequence. This allows the design of synthetic genes as well as the modular redesign after introducing limited base pair mismatches in wild-type genes in order to adapt them for "cassette" mutagenesis. The GMAP program uses an algorithm based on set theory that reduces the degree of complexity from an exponential to linear function of sequence length. Therefore, the speed of searching for potential R.E. sites in reverse-translated gene sequences and the prediction of new R.E. sites in natural genes by mutations are rapid.
已开发出一种名为GMAP的计算机程序,用于:i) 绘制可引入明确DNA序列中的潜在限制性内切酶(R.E.)位点;ii) 预测在明确DNA序列中引入独特R.E.位点所需的突变;iii) 在通过给定氨基酸序列反向翻译获得的模糊DNA序列中搜索所有R.E.位点。这有助于合成基因的设计,以及在野生型基因中引入有限碱基对错配后进行模块化重新设计,以便使其适用于“盒式”诱变。GMAP程序使用一种基于集合论的算法,将复杂度从序列长度的指数函数降低到线性函数。因此,在反向翻译的基因序列中搜索潜在R.E.位点以及通过突变预测天然基因中新R.E.位点的速度很快。