loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)
Introducing Variable Gap Penalties into Three-Sequence Alignment for Protein Sequences
March 25-March 28
ISBN: 978-0-7695-3096-3
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.
Index Terms:
sequence alignment, three-sequence alignment, variable gap penalties, dynamic programming
Citation:
Che-Lun Hung, Chun-Yuan Lin, Yeh-Ching Chung, Chuan Yi Tang, "Introducing Variable Gap Penalties into Three-Sequence Alignment for Protein Sequences," ainaw, pp.726-731, 22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008), 2008
Usage of this product signifies your acceptance of the Terms of Use.