Empirical determination of effective gap penalties for sequence comparison.
BACKGROUND
No general theory guides the selection of gap penalties for local sequence alignment. We empirically determined the most effective gap penalties for protein sequence similarity searches with substitution matrices over a range of target evolutionary distances from 20 to 200 Point Accepted Mutations (PAMs).


RESULTS
We embedded real and simulated homologs of protein sequences into a database and searched the database to determine the gap penalties that produced the best statistical significance for the distant homologs. The most effective penalty for the first residue in a gap (q+r) changes as a function of evolutionary distance, while the gap extension penalty for additional residues (r) does not. For these data, the optimal gap penalties for a given matrix scaled in 1/3 bit units (e.g. BLOSUM50, PAM200) are q=25-0.1 * (target PAM distance), r=5. Our results provide an empirical basis for selection of gap penalties and demonstrate how optimal gap penalties behave as a function of the target evolutionary distance of the substitution matrix. These gap penalties can improve expectation values by at least one order of magnitude when searching with short sequences, and improve the alignment of proteins containing short sequences repeated in tandem.
Reese
J T
JT
Department of Biochemistry and Molecular Genetics, University of Virginia, Charlottesville, VA 22908, USA.
Pearson
W R
WR
D000595:Amino Acid Sequence; D003198:Computer Simulation; D030562:Databases, Protein; D019143:Evolution, Molecular; D014644:Genetic Variation / Q000235:genetics*; D008969:Molecular Sequence Data; D017354:Point Mutation / Q000235:genetics; D011786:Quality Control; D016415:Sequence Alignment / Q000379:methods*; D020539:Sequence Analysis, Protein; D017384:Sequence Deletion / Q000235:genetics; D017386:Sequence Homology, Amino Acid