Skip Navigation

This Article
Right arrow Print PDF (183K)
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 arrow Commercial Re-use Guidelines
for Open Access NAR Content
Google Scholar
Right arrow Articles by Waterman, M. S.
Right arrow Articles by Katcher, H. L.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Waterman, M. S.
Right arrow Articles by Katcher, H. 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 237-242
© 1984

MAIN-FRAME COMPUTERS

Algorithms for restriction map comparisons

Michael S. Waterman, Temple F. Smith and Harold L. Katcher

Departments of Mathematics and Biological Sciences, University of Southern California Los Angeles, CA 90089, USA

Received August 12, 1983. An algorithm is presented which compares two restriction maps, yielding a measure of distance between the maps and relating the maps by an alignment. This new algorithm finds the minimum weighted sum of genetic events required to convert one map into the research-article, where the genetic events are the appearance/disappearance of restriction sites and changes in the number of bases between restriction sites. The algorithm is illustrated by comparison of the ß-{delta} region of the globin gene cluster of four primate species. The results are in excellent agreement with known evolutionary relationships.


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.