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

© Oxford University Press

A note about computing all local alignments

Webb Miller and Mark Boguski 1

Department of Computer Science and Engineering, The Pennsylvania State University University Park, PA 16802
1National Center for Biotechnology Information, National Library of Medicine, National Institutes of Health Bethesda, MD 20894, USA

A recent paper in this journal by G. Barton proposed an efficient algorithm for locating locally optimal alignments between two sequences. Although the paper claims that all such alignments are found, the approach frequently fails to detect some of the significant matches. This note explains the deficiency.

Received on March 3, 1994; accepted on April 8, 1994

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.