Computational and Experimental Evaluation of the Immune Response of Neoantigens for Personalized Vaccine Design.

In the last few years, the importance of neoantigens in the development of personalized antitumor vaccines has increased remarkably. In order to study whether bioinformatic tools are effective in detecting neoantigens that generate an immune response, DNA samples from patients with cutaneous melanoma in different stages were obtained, resulting in a total of 6048 potential neoantigens gathered. Thereafter, the immunological responses generated by some of those neoantigens ex vivo were tested, using a vaccine designed by a new optimization approach and encapsulated in nanoparticles. Our bioinformatic analysis indicated that no differences were found between the number of neoantigens and that of non-mutated sequences detected as potential binders by IEDB tools. However, those tools were able to highlight neoantigens over non-mutated peptides in HLA-II recognition (p-value 0.03). However, neither HLA-I binding affinity (p-value 0.08) nor Class I immunogenicity values (p-value 0.96) indicated significant differences for the latter parameters. Subsequently, the new vaccine, using aggregative functions and combinatorial optimization, was designed. The six best neoantigens were selected and formulated into two nanoparticles, with which the immune response ex vivo was evaluated, demonstrating a specific activation of the immune response. This study reinforces the use of bioinformatic tools in vaccine development, as their usefulness is proven both in silico and ex vivo.

A combinatorial approach to the design of vaccines.

We present two new problems of combinatorial optimization and discuss their applications to the computational design of vaccines. In the shortest λ-superstring problem, given a family S1,...,S(k) of strings over a finite alphabet, a set Τ of "target" strings over that alphabet, and an integer λ, the task is to find a string of minimum length containing, for each i, at least λ target strings as substrings of S(i). In the shortest λ-cover superstring problem, given a collection X1,...,X(n) of finite sets of strings over a finite alphabet and an integer λ, the task is to find a string of minimum length containing, for each i, at least λ elements of X(i) as substrings. The two problems are polynomially equivalent, and the shortest λ-cover superstring problem is a common generalization of two well known combinatorial optimization problems, the shortest common superstring problem and the set cover problem. We present two approaches to obtain exact or approximate solutions to the shortest λ-superstring and λ-cover superstring problems: one based on integer programming, and a hill-climbing algorithm. An application is given to the computational design of vaccines and the algorithms are applied to experimental data taken from patients infected by H5N1 and HIV-1.