Refinement of the Computational Vaccine Optimization Framework (OptiVax) through the development and analysis of a better algorithm for vaccine design choice
Name
Dimitrakakis-dimitral-meng-eecs-2021-thesis.pdf
Description
Thesis PDF
Size
6.63 MB
Format
Adobe PDF
Checksum (MD5)
06832f0161b9bfec4cafdff7ba0a7dc4
Author(s)
Dimitrakakis, Alexander
Advisor(s)
Gifford, David
Date Issued
September 2021
Publisher
Massachusetts Institute of Technology
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
In Copyright - Educational Use Permitted
Copyright MIT
Persistent DSpace Link
