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.
Full text
PDF
Selected References
These references are in PubMed. This may not be the complete list of references from this article.
- Parker R. C., Watson R. M., Vinograd J. Mapping of closed circular DNAs by cleavage with restriction endonucleases and calibration by agarose gel electrophoresis. Proc Natl Acad Sci U S A. 1977 Mar;74(3):851–855. doi: 10.1073/pnas.74.3.851. [DOI] [PMC free article] [PubMed] [Google Scholar]
- Schroeder J. L., Blattner F. R. Least-squares method for restriction mapping. Gene. 1978 Oct;4(2):167–174. doi: 10.1016/0378-1119(78)90028-8. [DOI] [PubMed] [Google Scholar]