DocumentCode
464298
Title
Predicting Peptide Binders of Flexible Lengths with Genetic Annealing Algorithm
Author
Rajapakse, Menaka ; Feng, Lin
Author_Institution
Inst. for Infocomm Res., Singapore
fYear
2007
fDate
1-5 April 2007
Firstpage
262
Lastpage
267
Abstract
Prediction of peptides that bind to major histocompatibility complex class II (MHC-II) molecules is vital for drug discovery and vaccine development. Prediction of peptides binding to MHC-II molecules is complicated because of the broad range of their lengths. Peptides bind to the molecules at an ungapped motif present at the binding site. Obtaining an alignment of binding sites of binding proteins facilitates determining of the binding motif. However, multiple sequence alignment often fails on peptides. In this paper, we propose a genetic annealing algorithm (GAA) to identify an alignment for binding peptides that can subsequently be used to predict binding peptides. Our approach is demonstrated with a dataset having difficulty in finding a consensus motif through experimental means and using existing motif detection methods. GAA based approach outperformed Gibbs motif sampler and RANKPEP approaches in predicting peptides binding to MHC II molecules.
Keywords
biology computing; drugs; genetic algorithms; molecular biophysics; drug discovery; genetic annealing algorithm; major histocompatibility complex class II molecules; multiple sequence alignment; peptide binders; vaccine development; Amino acids; Annealing; Artificial neural networks; Computational intelligence; Genetics; Hidden Markov models; Peptides; Sequences; Support vector machine classification; Support vector machines; Genetic algorithm; MHC molecules; motif; peptide binding;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence and Bioinformatics and Computational Biology, 2007. CIBCB '07. IEEE Symposium on
Conference_Location
Honolulu, HI
Print_ISBN
1-4244-0710-9
Type
conf
DOI
10.1109/CIBCB.2007.4221231
Filename
4221231
Link To Document