A combinatorial approach to the design of vaccines

DOI10.1007/s00285-014-0797-4zbMath1314.92082OpenAlexW2042348557WikidataQ42216755 ScholiaQ42216755MaRDI QIDQ2339974

Yanyan Li

Publication date: 14 April 2015

Published in: Journal of Mathematical Biology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00285-014-0797-4

zbMATH Keywords

integer programmingcombinatorial optimizationset cover problemhill-climbingshortest common superstring problemvaccine design

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Medical applications (general) (92C50) Algorithms on strings (68W32)

Related Items (1)

COVID-19 and SARS-CoV-2. Modeling the present, looking at the future

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A greedy approximation algorithm for constructing shortest common superstrings
• On finding minimal length superstrings
• Persistent behavior in a phase-shift sequence of periodical biochemical oscillations
• Algorithmic construction of sets for k -restrictions
• Integer Programming Formulation of Traveling Salesman Problems
• Linear approximation of shortest superstrings
• Teaching Integer Programming Formulations Using the Traveling Salesman Problem

This page was built for publication: A combinatorial approach to the design of vaccines