Applying bioinformatics for antibody epitope prediction using affinity-selected mimotopes – relevance for vaccine design
Bibliographic record
Abstract
To properly characterize protective polyclonal antibody responses, it is necessary to examine epitope specificity. Most antibody epitopes are conformational in nature and, thus, cannot be identified using synthetic linear peptides. Cyclic peptides can function as mimetics of conformational epitopes (termed mimotopes), thereby providing targets, which can be selected by immunoaffinity purification. However, the management of large collections of random cyclic peptides is cumbersome. Filamentous bacteriophage provides a useful scaffold for the expression of random peptides (termed phage display) facilitating both the production and manipulation of complex peptide libraries. Immunoaffinity selection of phage displaying random cyclic peptides is an effective strategy for isolating mimotopes with specificity for a given antiserum. Further epitope prediction based on mimotope sequence is not trivial since mimotopes generally display only small homologies with the target protein. Large numbers of unique mimotopes are required to provide sufficient sequence coverage to elucidate the target epitope. We have developed a method based on pattern recognition theory to deal with the complexity of large collections of conformational mimotopes. The analysis consists of two phases: 1) The learning phase where a large collection of epitope-specific mimotopes is analyzed to identify epitope specific "signs" and 2) The identification phase where immunoaffinity-selected mimotopes are interrogated for the presence of the epitope specific "signs" and assigned to specific epitopes. We are currently using computational methods to define epitope "signs" without the need for prior knowledge of specific mimotopes. This technology provides an important tool for characterizing the breadth of antibody specificities within polyclonal antisera.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".