paper-with-me

홈 › Papers

OLGA: fast computation of generation probabilities of B- and T-cell receptor amino acid sequences and motifs

2018-11-13

Motivation: High-throughput sequencing of large immune repertoires has enabled the development of methods to predict the probability of generation by V(D)J recombination of T- and B-cell receptors of any specific nucleotide sequence. These generation probabilities are very non-homogeneous, ranging over 20 orders of magnitude in real repertoires. Since the function of a receptor really depends on its protein sequence, it is important to be able to predict this probability of generation at the amino acid level. However, brute-force summation over all the nucleotide sequences with the correct amino acid translation is computationally intractable. The purpose of this paper is to present a solution to this problem. Results: We use dynamic programming to construct an efficient and flexible algorithm, called OLGA (Optimized Likelihood estimate of immunoGlobulin Amino-acid sequences), for calculating the probability of generating a given CDR3 amino acid sequence or motif, with or without V/J restriction, as a result of V(D)J recombination in B or T cells. We apply it to databases of epitope-specific T-cell receptors to evaluate the probability that a typical human subject will possess T cells responsive to specific disease-associated epitopes. The model prediction shows an excellent agreement with published data. We suggest that OLGA may be a useful tool to guide vaccine design. Availability: Source code is available at https://github.com/zsethna/OLGA

📄 PDF Abstract BibTeX arXiv:1807.04425

Code (2)

zsethna/OLGA 공식 구현
statbiophys/olga

Similar Papers 제목 키워드 기반

SOS: Online probability estimation and generation of T and B cell receptors

2020-03-29 · Giulio Isacchini, Carlos Olivares, Armita Nourmohammad, Aleksandra M. Walczak 외

Recent advances in modelling VDJ recombination and subsequent selection of T and B cell receptors provide useful tools to analyze and compare immune repertoires across time, individuals, and tissues. A suite of tools--IG…

EvolGAN: Evolutionary Generative Adversarial Networks

2020-09-28 · Baptiste Roziere, Fabien Teytaud, Vlad Hosu, Hanhe Lin 외

We propose to use a quality estimator and evolutionary methods to search the latent space of generative adversarial networks trained on small, difficult datasets, or both. The new method leads to the generation of signif…

Diversity

A Reinforcement Learning-Driven Transformer GAN for Molecular Generation

2025-03-17 · Chen Li, Huidong Tang, Ye Zhu, Yoshihiro Yamanishi

Generating molecules with desired chemical properties presents a critical challenge in fields such as chemical synthesis and drug discovery. Recent advancements in artificial intelligence (AI) and deep learning have sign…

Drug Discoveryreinforcement-learningReinforcement LearningReinforcement Learning (RL)

MolGAN: An implicit generative model for small molecular graphs

2018-05-30 · Nicola De Cao, Thomas Kipf

Deep generative models for graph-structured data offer a new angle on the problem of chemical synthesis: by optimizing differentiable models that directly generate molecular graphs, it is possible to side-step expensive …

Graph MatchingReinforcement Learningvalid

Vanna-Volga pricing for single and double barrier FX options

2022-11-23 · J. Martín Ovejero

In this paper, we provide a unified treatment of the Vanna-Volga pricing technique. We derive the value of single and double barriers FX options, as well as closed formulas for the Delta, Vega, Vanna and Volga of those c…