Optimal vaccination schedules using simulated annealing

33Citations
Citations of this article
39Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Since few years the problem of finding optimal solutions for drug or vaccine protocols have been tackled using system biology modeling. These approaches are usually computationally expensive. Our previous experiences in optimizing vaccine or drug protocols using genetic algorithms required the use of a high performance computing infrastructure for a couple of days. In the present article we show that by an appropriate use of a different optimization algorithm, the simulated annealing, we have been able to downsize the computational effort by a factor 102. The new algorithm requires computational effort that can be achieved by current generation personal computers. © The Author 2008. Published by Oxford University Press. All rights reserved.

Cite

CITATION STYLE

APA

Pennisi, M., Catanuto, R., Pappalardo, F., & Motta, S. (2008). Optimal vaccination schedules using simulated annealing. Bioinformatics, 24(15), 1740–1742. https://doi.org/10.1093/bioinformatics/btn260

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free