PEDS Advance Access originally published online on January 19, 2006
Protein Engineering Design and Selection 2006 19(3):129-133; doi:10.1093/protein/gzj005
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
SHORT COMMUNICATION |
Variable gap penalty for protein sequencestructure alignment
1Departments of Biopharmaceutical Sciences and Pharmaceutical Chemistry and California Institute for Quantitative Biomedical Research, University of California at San Francisco, San Francisco, CA 94143 and 2Structural Biology Program, Mount Sinai School of Medicine, Box 1677, 1425 Madison Avenue, New York, NY 10029, USA
3 To whom correspondence should be addressed. E-mail: sali{at}salilab.org
The penalty for inserting gaps into an alignment between two protein sequences is a major determinant of the alignment accuracy. Here, we present an algorithm for finding a globally optimal alignment by dynamic programming that can use a variable gap penalty (VGP) function of any form. We also describe a specific function that depends on the structural context of an insertion or deletion. It penalizes gaps that are introduced within regions of regular secondary structure, buried regions, straight segments and also between two spatially distant residues. The parameters of the penalty function were optimized on a set of 240 sequence pairs of known structure, spanning the sequence identity range of 2040%. We then tested the algorithm on another set of 238 sequence pairs of known structures. The use of the VGP function increases the number of correctly aligned residues from 81.0 to 84.5% in comparison with the optimized affine gap penalty function; this difference is statistically significant according to Student's t-test. We estimate that the new algorithm allows us to produce comparative models with an additional
7 million accurately modeled residues in the
1.1 million proteins that are detectably related to a known structure.
Keywords: comparative protein structure modeling/gap penalty function/homology modeling/sequencestructure alignment
Received October 31, 2005; revised December 2, 2005; accepted December 2, 2005.
Edited by Valerie Daggett
![]()
CiteULike
Connotea
Del.icio.us What's this?
This article has been cited by other articles:
![]() |
N. Fernandez-Fuentes, B. K. Rai, C. J. Madrid-Aliste, J. Eduardo Fajardo, and A. Fiser Comparative protein structure modeling by combining multiple templates and optimizing sequence-to-structure alignments Bioinformatics, October 1, 2007; 23(19): 2558 - 2565. [Abstract] [Full Text] [PDF] |
||||
![]() |
J. A. R. Dalton and R. M. Jackson An evaluation of automated homology modelling methods at low target template sequence similarity Bioinformatics, August 1, 2007; 23(15): 1901 - 1908. [Abstract] [Full Text] [PDF] |
||||
![]() |
B. K. Rai, C. J. Madrid-Aliste, J. E. Fajardo, and A. Fiser MMM: a sequence-to-structure alignment protocol Bioinformatics, November 1, 2006; 22(21): 2691 - 2692. [Abstract] [Full Text] [PDF] |
||||
