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 Karlin, S.
Right arrow Articles by Leung, M.-Y.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Karlin, S.
Right arrow Articles by Leung, M.-Y.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 1988 IRL Press Ltd

Algorithms for identifying local molecular sequence features

Samuel Karlin *, Macdonald Morris , Ghassan Ghandour and Ming-Ying Leung

Department of Mathematics, Stanford University Stanford, CA 94305, USA

*To whom reprint requests should be sent

Efficient algorithms are described for identifying local molecular sequence features including repeats, dyad symmetry pairings and aligned matches between sequences, while allowing for errors. Specific applications are given to the genomic sequences of the Epstein-Barr virus, Varicella-Zoster virus and the bacteriophages {lambda} and T7.

Received on October 6, 1987; accepted on December 13, 1987

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.