Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Mallios, R. R.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Mallios, R. R.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© Oxford University Press

An iterative algorithm for converting a class II MHC binding motif into a quantitative predictive model

Ronna R. Mallios

Medical Information Resources, University of California San Francisco, Fresno, CA 93703, USA E-mail: ronna{at}ucsfresno.edu

Biochemists and molecular biologists have suggested motifs for characterizing the binding of peptide fragments and class II major histocompatibility complex (MHC) molecules based on laboratory results and crystal structures. The iterative algorithm presented here converts a suggested motif into a quantitative data-based model. The database accessed consists of peptide fragments known to bind or not bind to class II MHC molecules of particular haplotypes. Stepwise discriminant analysis is utilized to increase or decrease motif coefficients until the resulting motif classifies all binders and non-binders correctly. Stepwise discriminant analysis is a standard multivariate statistical procedure and is available in comprehensive commercial statistical packages. Program 7M of BMDP Statistical Software was used in this study.

Received on March 4, 1996; accepted on November 20, 1996

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.