Nolan G P, Maina C V, Szalay A A
Nucleic Acids Res. 1984 Jan 11;12(1 Pt 2):717-29. doi: 10.1093/nar/12.1part2.717.
Three new computer algorithms are described which rapidly order the restriction fragments of a plasmid DNA which has been cleaved with two restriction endonucleases in single and double digestions. Two of the algorithms are contained within a single computer program (called MPCIRC). The Rule-Oriented algorithm, constructs all logical circular map solutions within sixty seconds (14 double-digestion fragments) when used in conjunction with the Permutation method. The program is written in Apple Pascal and runs on an Apple II Plus Microcomputer with 64K of memory. A third algorithm is described which rapidly maps double digests and uses the above two algorithms as adducts. Modifications of the algorithms for linear mapping are also presented.
本文描述了三种新的计算机算法,它们能快速对质粒DNA的限制性片段进行排序。该质粒DNA已用两种限制性内切酶进行单酶切和双酶切。其中两种算法包含在一个名为MPCIRC的计算机程序中。面向规则的算法与排列方法结合使用时,能在60秒内构建出所有逻辑环状图谱解决方案(针对14个双酶切片段)。该程序用苹果Pascal语言编写,在内存为64K的苹果II Plus微型计算机上运行。还描述了第三种算法,它能快速绘制双酶切图谱,并将上述两种算法用作附加物。文中还介绍了用于线性图谱绘制的算法修改。