DocumentCode
3220013
Title
Introducing Variable Gap Penalties into Three-Sequence Alignment for Protein Sequences
Author
Hung, Che-Lun ; Lin, Chun-Yuan ; Chung, Yeh-Ching ; Tang, Chuan Yi
Author_Institution
Nat. Tsing Hua Univ., Hsinchu
fYear
2008
fDate
25-28 March 2008
Firstpage
726
Lastpage
731
Abstract
The common-use gap penalty strategies, constant penalty and affine gap penalty, have been adopted in the traditional three-sequence alignment algorithm which considers the insertion, deletion and substitution. However, these strategies are not suitable to protein sequence alignments. For the alignment accuracy of protein sequences, the gap penalty is a major determinant. Incorporating protein structure information to vary the gap penalties can lead to more biologically correct alignments. Here, we present an algorithm to find a global and optimal alignment among three protein sequences by using position- specific gap penalties which allow gap penalties to be varied. Thus, residue-dependent information and protein structure information can be applied to the three-sequence alignment. The experimental results show that our algorithm achieves the significant improvement in the accuracy of alignments than the three-sequence alignment algorithm with the affine gap penalty for protein sequences.
Keywords
biology computing; molecular biophysics; proteins; sequences; biologically correct alignment; protein sequence alignment; protein structure information; three-sequence alignment algorithm; Application software; Computer science; DNA; Dynamic programming; Iterative algorithms; Phylogeny; Protein engineering; Protein sequence; RNA; Testing; dynamic programming; sequence alignment; three-sequence alignment; variable gap penalties;
fLanguage
English
Publisher
ieee
Conference_Titel
Advanced Information Networking and Applications - Workshops, 2008. AINAW 2008. 22nd International Conference on
Conference_Location
Okinawa
Print_ISBN
978-0-7695-3096-3
Type
conf
DOI
10.1109/WAINA.2008.101
Filename
4483002
Link To Document