{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/139942"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/139942","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"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.","abstract_html":"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.","abstract_has_math":false,"creators":["Dimitrakakis, Alexander"],"institution":"Massachusetts Institute of Technology","degree_name":"Master","degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science","school":null,"contributors":[],"advisors":["Gifford, David"],"committee_chairs":[],"committee_members":[],"year":2021,"date_issued":"2021-09","date_published":"2021-09","updated_at":"2026-07-22T22:20:52Z","subjects":[],"languages":[],"rights":["In Copyright - Educational Use Permitted","Copyright MIT"],"rights_urls":["http://rightsstatements.org/page/InC-EDU/1.0/"],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1721.1/139942","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Gifford, David"]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science"]},{"key":"dc:creator","label":"Author","values":["Dimitrakakis, Alexander"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2022-02-07T15:14:13Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2022-02-07T15:14:13Z"]},{"key":"dc:date.issued","label":"Date","values":["2021-09"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master","Master of Engineering in Electrical Engineering and Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["In Copyright - Educational Use Permitted","Copyright MIT"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://rightsstatements.org/page/InC-EDU/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1721.1/139942"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M.Eng."]},{"key":"dc:title","label":"Title","values":["Refinement of the Computational Vaccine Optimization Framework (OptiVax) through the development and analysis of a better algorithm for vaccine design choice"]}]}],"canonical_facts":{"dc:contributor.advisor":["Gifford, David"],"dc:contributor.department":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science"],"dc:creator":["Dimitrakakis, Alexander"],"dc:date.accessioned":["2022-02-07T15:14:13Z"],"dc:date.available":["2022-02-07T15:14:13Z"],"dc:date.issued":["2021-09"],"dc:description.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."],"dc:description.degree":["M.Eng."],"dc:identifier.uri":["https://hdl.handle.net/1721.1/139942"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["In Copyright - Educational Use Permitted","Copyright MIT"],"dc:rights.uri":["http://rightsstatements.org/page/InC-EDU/1.0/"],"dc:title":["Refinement of the Computational Vaccine Optimization Framework (OptiVax) through the development and analysis of a better algorithm for vaccine design choice"],"dc:type":["Thesis"],"thesis:degree_name":["Master","Master of Engineering in Electrical Engineering and Computer Science"]},"updated_at":"2026-07-22T22:20:52Z"}