Skip Navigation

This Article
Right arrow Full Text (Print PDF)
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 Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Wulkan, M.
Right arrow Articles by Lott, T. J.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Wulkan, M.
Right arrow Articles by Lott, T. J.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© IRL Press Limited

Computer-aided construction of nucleic acid restriction maps using defined vectors

Mark Wulkan and Timothy J. Lott *

Department of Biology Biology Building, 1555 Pierce Drive Emory University Atlanta, GA 30329, USA

*To whom enquiries and correspondence should be sent

A new algorithm is described that will rapidly produce restriction maps of cloned DNA fragments. Information concerning the vector is stored as a data file and used in constructing probable maps. As the program is based upon a permutation analysis it has two primary uses. First, preliminary restriction maps can be created from fragment length data as a starting point for further analysis. Second, existing maps can be confirmed as being highly probable, and other probable maps examined to ensure certain combinations have not been overlooked. Although primarily designed for linear vectors, the program can be used to calculate circular maps.

Received on June 5, 1985; accepted on September 27, 1985

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


This article has been cited by other articles:


Home page
 Mol Biol EvolHome page
B. R. Holland, K. T. Huber, A. Dress, and V. Moulton
{delta} Plots: A Tool for Analyzing Phylogenetic Distance Data
Mol. Biol. Evol., December 1, 2002; 19(12): 2051 - 2059.
[Abstract] [Full Text] [PDF]


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.