Skip to content
naulon
Not checkedNot checked for notices yet.

Design of high-order antibiotic combinations against M. tuberculosis by ranking and exclusion

Kaan Yilancioglu, Murat Cokol

Scientific Reports · 2019

doi:10.1038/s41598-019-48410-y (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Combinations of more than two drugs are routinely used for the treatment of pathogens and tumors. High-order combinations may be chosen due to their non-overlapping resistance mechanisms or for favorable drug interactions. Synergistic/antagonistic interactions occur when the combination has a higher/lower effect than the sum of individual drug effects. The standard treatment of Mycobacterium tuberculosis (Mtb) is an additive cocktail of three drugs which have different targets. Herein, we experimentally measured all 190 pairwise interactions among 20 antibiotics against Mtb growth. We used the pairwise interaction data to rank all possible high-order combinations by strength of synergy/antagonism. We used drug interaction profile correlation as a proxy for drug similarity to establish exclusion criteria for ideal combination therapies. Using this ranking and exclusion design (R/ED) framework, we modeled ways to improve the standard 3-drug combination with the addition of new drugs. We applied this framework to find the best 4-drug combinations against drug-resistant Mtb by adding new exclusion criteria to R/ED. Finally, we modeled alternating 2-order combinations as a cycling treatment and found optimized regimens significantly reduced the overall effective dose. R/ED provides an adaptable framework for the design of high-order drug combinations against any pathogen or tumor.

Abstract licence: CC BY-NC-ND

References34

  1. 4.
  2. 26.
  3. 32.
  4. 33.

30 more references, whose wording the paper’s licence keeps private.

Cited by papers we hold1

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.