Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
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 ISI Web of Science
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 (9)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Mott, R.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Mott, R.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics, Vol 15, 455-462, Copyright © 1999 by Oxford University Press

ARTICLES

Local sequence alignments with monotonic gap penalties

R Mott
SmithKline-Beecham Pharmaceuticals R & D, New Frontiers Science Park (North),3rd Avenue, Harlow CM19 5AW, UK. Richard.Mott@well.ox.ac.uk

MOTIVATION: Sequence alignments obtained using affine gap penalties are not always biologically correct, because the insertion of long gaps is over-penalised. There is a need for an efficient algorithm which can find local alignments using non-linear gap penalties. RESULTS: A dynamic programming algorithm is described which computes optimal local sequence alignments for arbitrary, monotonically increasing gap penalties, i.e. where the cost g(k) of inserting a gap of k symbols is such that g(k) >/= g(k-1). The running time of the algorithm is dependent on the scoring scheme; if the expected score of an alignment between random, unrelated sequences of lengths m, n is proportional to log mn, then with one exception, the algorithm has expected running time O(mn). Elsewhere, the running time is no greater than O(mn(m+n)). Optimisations are described which appear to reduce the worst-case run- time to O(mn) in many cases. We show how using a non-affine gap penalty can dramatically increase the probability of detecting a similarity containing a long gap. AVAILABILITY: The source code is available to academic collaborators under licence.
Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 BioinformaticsHome page
R. A. Cartwright
Ngila: global pairwise alignments with logarithmic and affine gap costs
Bioinformatics, June 1, 2007; 23(11): 1427 - 1428.
[Abstract] [Full Text] [PDF]

Home page
 Protein Eng Des SelHome page
M.S. Madhusudhan, M. A. Marti-Renom, R. Sanchez, and A. Sali
Variable gap penalty for protein sequence-structure alignment
Protein Eng. Des. Sel., March 1, 2006; 19(3): 129 - 133.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
S. Sheetlin, Y. Park, and J. L. Spouge
The Gumbel pre-factor k for gapped local alignment can be estimated from simulations of global alignment
Nucleic Acids Res., September 6, 2005; 33(15): 4987 - 4994.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
N. C. W. Goonesekere and B. Lee
Frequency of gaps observed in a structurally aligned protein pair database suggests a simple gap penalty function
Nucleic Acids Res., May 20, 2004; 32(9): 2838 - 2843.
[Abstract] [Full Text] [PDF]


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.