Predicting binding peptides with simultaneous optimization of entropy and evolutionary distance

Authors:
Menaka Rajapakse;Lin Feng
Affiliations:
Institute for Infocomm Research, Singapore and School of Computer Engineering, Nanyang Technological University, Singapore;School of Computer Engineering, Nanyang Technological University, Singapore
Venue:
PRIB'07 Proceedings of the 2nd IAPR international conference on Pattern recognition in bioinformatics
Year:
2007

Citing 3
Cited 0

Improved prediction of MHC class I and class II epitopes using a novel Gibbs sampling approach

Bioinformatics
EPIMHC: a curated database of MHC-binding peptides for customized computational vaccinology

Bioinformatics
A fast and elitist multiobjective genetic algorithm: NSGA-II

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Identifying antigenic peptides that bind to Major Histocompatibility Complex (MHC) molecules plays a central role in determining T-cell epitopes suitable as vaccine targets. Prediction of the binding ability of antigenic peptides to MHC class II molecules is more complex that for class I. Class II molecules bind to peptides of different lengths and the core region that interacts with the binding site on the class II MHC molecule is located anywhere within the peptide. Obtaining an alignment for these binding sites is an important first step in determining the binding motif of MHC class II alleles. In this paper, we exploit entropy and evolutionary distance of the key binding positions (anchor positions) of an alignment in determining the best possible alignment for a given set of peptide data. Once an optimal alignment is found, a weight matrix representing the binding motif is estimated. The weight matrix designed is subsequently applied to predict MHC binding peptides.