Skip Navigation

This Article
Right arrow Print PDF (170K)
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 Search for citing articles in:
ISI Web of Science (25)
Right arrowRequest Permissions
Right arrow Commercial Re-use Guidelines
for Open Access NAR Content
Google Scholar
Right arrow Articles by Bishop, M.
Right arrow Articles by Thompson, E.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Bishop, M.
Right arrow Articles by Thompson, E.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Nucleic Acids Research, 1984, Vol. 12, No. 13 5471-5474
© 1984

MOLECULAR BIOLOGY

Fast computer search for similar DNA sequences

Martin Bishop* and Elizabeth Thompson{dagger}

*University of Cambridge, Department of Zoology Downing Street, Cambridge, CB2 3EJ {dagger}University of Cambridge, Department of Pure Mathematics and Mathematical Statistics, Statistical Laboratory 16 Mill Lane, Cambridge, CB2 1SB, UK

Received April 2, 1984. Accepted June 11, 1984.

An extremely fast method of searching a nucleic acid sequence database against a probe sequence is described. The method is based the detection of deviation from expected number and deviation from random spatial distribution of sub-sequences which are unique within a sequence, and shared between that sequence and the probe. On an IBM 3081 computer, total search of an encoded form of the EMBL nucleic acid sequence database with a 1 kbase probe sequence is completed in a few seconds. Previous best methods for a similar task required 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.