Back to results
Massachusetts Institute of Technology
Refinement of the Computational Vaccine Optimization Framework (OptiVax) through the development and analysis of a better algorithm for vaccine design choice
Abstract
dc:description.abstractWe 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.
Degree
thesis:*- Name thesis:degree_name
- Master
- Department dc:contributor.department
- Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
- Grantor dc:publisher
- Massachusetts Institute of Technology
- Year dc:date.issued
- 2021
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Dimitrakakis, Alexander
- Advisor dc:contributor.advisor
-
- Gifford, David
Rights
dc:rights- Statement dc:rights
-
- In Copyright - Educational Use Permitted
- Copyright MIT
- Licence dc:rights.uri
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- https://hdl.handle.net/1721.1/139942
- OAI identifier oai:identifier
- oai:dspace.mit.edu:1721.1/139942