Skip Navigation

This Article
Right arrow Print PDF (269K)
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 Boswell, D.R.
Right arrow Articles by McLachlan, A. D.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Boswell, D.R.
Right arrow Articles by McLachlan, A. D.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Nucleic Acids Research, 1984, Vol. 12, No. 1Part2 457-464
© 1984

MINICOMPUTERS

Sequence comparison by exponentially-damped alignment

D.Ross Boswell and Andrew D. McLachlan

MRC Laboratory of Molecular Biology Hills Road, Cambridge CB2 2QH, UK

Received August 17, 1983. We describe a new method of comparing sequences, based on the Needleman-Wunsch sequence alignment algorithm, which can detect similarities that are interrupted by insertions or deletions in either sequence. The sequences are compared by calculating for each pair of residues a score which represents the best local alignment bringing those residues into correspondence; smooth localisation is achieved by reducing the contribution of distant parts of the alignment path by a factor which decreases exponentially with their distance from the point in question. The calculated values are used to draw a line graph in which regions of local similarity are shown by diagonal lines. Examples are shown of the application of the method to nucleic acid and amino acid sequences.


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.