Skip Navigation

This Article
Right arrow Print PDF (388K)
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 Poiner, G.
Right arrow Articles by Orosz, L.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Poiner, G.
Right arrow Articles by Orosz, L.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Nucleic Acids Research, 1984, Vol. 12, No. 1Part1 227-236
© 1984

MAIN-FRAME COMPUTERS

PMAP, PMAPS: DNA physical map constructing programs

Gábor Poiner, László Dorgai and László Orosz

Department of Genetics, Attila Joózsef University 6726 Szeged, Középlasor 52, Hungary

Received July 27, 1983. Computer programs are described, which facilitate the construction of the restriction site (physical) map of DNA molecules. By knowing the length of each fragment and its degree of error in the single and the double restriction enzyme digestions, the programs give all the possibilities for the physical map. This method is applicable to linear DNA molecules. Several examples are presented which indicate the high efficiency of the programs in constructing restriction site maps for the 62 Kb chromosome of bacteriophage 16–3. We have constructed complex maps. (i.e. Eco RI map with 16 and Eco RV with II fragments).


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.