Nucleic Acids Research, 1984, Vol. 12, No. 1Part2 717-729
© 1984
MICROCOMPUTERS |
Plasmid mapping computer program
Boyce Thompson Institute for Plant Research, Cornell University Tower Road, Ithaca, NY 14853, USA
*To whom correspondence concerning details of the program algorithms should be addressed.
Received October 11, 1983.
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.
+To whom reprint requests should be addressed
*Present address: Dept. of Cenetics, Stanford Medical Center, Stanford University, Stanford, CA 94305