Skip Navigation

This Article
Right arrow Print PDF (381K)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Right arrow Commercial Re-use Guidelines
for Open Access NAR Content
Google Scholar
Right arrow Articles by Pearson, W. R.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Pearson, W. R.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Nucleic Acids Research, 1982, Vol. 10, No. 1 217-227
© 1982

Articles

Automatic construction of restriction site maps

William R. Pearson

Department of Molecular Biology and Genetics, Johns Hopkins University School of Medicine Baltimore, MD 21205, USA

Received September 14, 1981. A computer program is described which constructs maps of restriction endonuclease cleavage sites in DNA molecules, given only the fragment lengths. The program utilizes fragment length data from single and double restriction enzyme digests to generate maps for linear or circular molecules. The search for a map can be limited to the unknown (insert) region of a recombinant phage or plasmid. Typical restriction maps with four or five enzymes which cut at three to five unknown sites can be calculated in a few minutes.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.