{"title":"A stochastic programming approach to the antibiotics time machine problem","authors":"Oğuz Mesüm, Ali Rana Atilgan, Burak Kocuk","doi":"10.1016/j.mbs.2024.109191","DOIUrl":null,"url":null,"abstract":"<div><p>Antibiotics Time Machine is an important problem to understand antibiotic resistance and how it can be reversed. Mathematically, it can be modeled as follows: Consider a set of genotypes, each of which contain a set of mutated and unmutated genes. Suppose that a set of growth rate measurements of each genotype under a set of antibiotics is given. The transition probabilities of a ‘realization’ of a Markov chain associated with each arc under each antibiotic are computable via a predefined function given the growth rate realizations. The aim is to maximize the expected probability of reaching to the genotype with all unmutated genes given the initial genotype in a predetermined number of transitions, considering the following two sources of uncertainties: (i) the randomness in growth rates, (ii) the randomness in transition probabilities, which are functions of growth rates. We develop stochastic mixed-integer linear programming and dynamic programming approaches to solve static and dynamic versions of the Antibiotics Time Machine Problem under the aforementioned uncertainties. We adapt a Sample Average Approximation approach that exploits the special structure of the problem and provide accurate solutions that perform very well in an out-of-sample analysis.</p></div>","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2024-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"99","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0025556424000518","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0
Abstract
Antibiotics Time Machine is an important problem to understand antibiotic resistance and how it can be reversed. Mathematically, it can be modeled as follows: Consider a set of genotypes, each of which contain a set of mutated and unmutated genes. Suppose that a set of growth rate measurements of each genotype under a set of antibiotics is given. The transition probabilities of a ‘realization’ of a Markov chain associated with each arc under each antibiotic are computable via a predefined function given the growth rate realizations. The aim is to maximize the expected probability of reaching to the genotype with all unmutated genes given the initial genotype in a predetermined number of transitions, considering the following two sources of uncertainties: (i) the randomness in growth rates, (ii) the randomness in transition probabilities, which are functions of growth rates. We develop stochastic mixed-integer linear programming and dynamic programming approaches to solve static and dynamic versions of the Antibiotics Time Machine Problem under the aforementioned uncertainties. We adapt a Sample Average Approximation approach that exploits the special structure of the problem and provide accurate solutions that perform very well in an out-of-sample analysis.
期刊介绍:
Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance.
Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.