Refinement of the Computational Vaccine Optimization Framework (OptiVax) through the development and analysis of a better algorithm for vaccine design choice

Abstract

We present the maximum 𝑛-times coverage objective function from a mathematical perspective. Its goal is to select a set number of overlays to maximize a population coverage metric. We formulate two novel algorithms to solve the problem: NTimesILP and WeightSum and compare them to each other and to the MarginalGreedy algorithm [30]. Finally, we link the mathematical formulation of the maximum 𝑛- times coverage problem to epitope vaccine design (OptiVax) and compare various vaccine designs both found in the literature and produced by the three aforementioned algorithms.