Skip Navigation

This Article
Right arrow Print PDF (624K)
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 Lefévre, C.
Right arrow Articles by Ikeda, J.-E.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Lefévre, C.
Right arrow Articles by Ikeda, J.-E.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Nucleic Acids Research, 1994, Vol. 22, No. 3 404-411
© 1994

COMPUTATIONAL BIOLOGY

A fast word search algorithm for the representation of sequence similarity in genomic DNA

Christophe Lefévre and Joh-E. Ikeda

Genosphere Project, ERATO, JRDC, Tokai University School of Medicine Isehara, Kanagawa 259-11, Japan

Received September 21, 1993. Accepted December 22, 1993.

Representation of sequence similarity by dot matrix plots is a method widely used for comparing biological sequences. The user Is presented with an overall view of similarity between two sequences. Computation of this plot has been reconsidered here. An improvement Is proposed through the preprocessing of the data into an automaton recognizing the word structure of a sequence. The main advantage of this approach is to systematically eliminate the repetitions during word comparison. Simple heuristics are also considered to greatly speed up pattern matching. As a result, large sequences are handled very efficiently. This is illustrated by a comparison of large genomic DNA. The algorithm has been implemented in an interactive application on a microcomputer.


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.