Plasmid mapping computer program
- 11 January 1984
- journal article
- research article
- Published by Oxford University Press (OUP) in Nucleic Acids Research
- Vol. 12 (1Part2) , 717-729
- https://doi.org/10.1093/nar/12.1part2.717
Abstract
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.Keywords
This publication has 2 references indexed in Scilit:
- Least-squares method for restriction mappingGene, 1978
- Mapping of closed circular DNAs by cleavage with restriction endonucleases and calibration by agarose gel electrophoresis.Proceedings of the National Academy of Sciences, 1977