- We are sorry, but NCBI web applications do not support your browser and may not function properly. More information

- Journal List
- BMC Syst Biol
- v.3; 2009
- PMC2738654

# Optimal drug combinations and minimal hitting sets

^{1}The Simons Center for Systems Biology, Institute for Advanced Study, Einstein Drive, Princeton, New Jersey 08540, USA

^{2}Department of Radiation Oncology, The Cancer Institute of New Jersey and UMDNJ-Robert Wood Johnson Medical School, 195 Little Albany Street New Brunswick, NJ 08903, USA

^{}Corresponding author.

This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

## Abstract

### Background

Identifying effective drug combinations that significantly improve over single agents is a challenging problem. Pairwise combinations already represent a huge screening effort. Beyond two drug combinations the task seems unfeasible.

### Results

In this work we introduce a method to uncover drug combinations with a putative effective response when presented to a heterogeneous population of malignant agents (strains), such as cancer cell lines or viruses. Using data quantifying the effect of single drugs over several individual strains, we search for minimal drug combinations that successfully target all strains. We show that the latter problem can be mapped to a minimal hitting set problem in mathematics. We illustrate this approach using data for the NCI60 panel of tumor derived cell lines, uncovering 14 anticancer drug combinations.

### Conclusion

The drug-response graph and the associated minimal hitting set method can be used to uncover effective drug combinations in anticancer drug screens and drug development programs targeting heterogeneous populations of infectious agents such as HIV.

## Background

The main stream in drug discovery has focused on identifying compounds targeting specific malignant agents, such as cancer subtypes or virus strains. In many cases, however, the target of drug therapy is a heterogeneous population of malignant agents, each characterized by a different degree of aggressiveness and response to therapy. Drug resistance is a clear example, whereby an induced or preexisting subpopulation of malignant agents is not responsive to a drug, escaping treatment.

Drug combinations can improve over single therapeuthic agents in two ways. Synergy between two drugs may result in a better response than the two drugs independently. A drug combination may also be more effective when targeting heterogeneous populations of malignant agents. In the latter case, although each single drug may be only effective for a subset of the malignant agents, the drug set as a whole may cover all malignant agents.

Uncovering drug combinations by direct screening is quite challenging due to the large number of potential combinations. A recent high-throughput screen was able to systematically test about 120,000 different two-drugs combinations [1]. Yet, programs like the NCI60 anticancer drug screen count with a stock of above 100,000 potential therapeuthic agents [2], resulting in more than 5 × 10^{9 }two-drugs combinations. The situation becomes even worse when addressing combinations of more than two drugs. More important, assuming that most drug combinations will not improve significantly over single drugs, attempting such high-throughput screens is highly inefficient.

Some interesting techniques are starting to emerge to tackle the potential scarcity of good combinations. The discovery process can be accelerated and the screening costs reduced using stochastic search algorithms and close-loop optimization [3]. Modeling and network approaches can help us to anticipate synergistic effects [4-6]. Yet, there is no general method to identify effective drug combinations from a very large drug stock.

In this work we introduce a systematic framework to uncover effective drug combinations. Our approach is based on the existence of a population of malignant agents (strains), a stock of drugs to target them and certain measure quantifying the response of each strain to each single drug. Starting from this data we construct a strain-drug response graph. Using this graph we show that the problem of finding the minimal number of drugs with a putative effective response over all strains is equivalent to the minimal hitting set problem in mathematics. We illustrate the applicability of this framework using data from the NCI60 anticancer drug screen as a case study. We report 14 drug combinations with a putative effective response over cancer types represented by the NCI60 panel of tumor derived cell lines.

## Results

### Mapping to a minimal hitting set problem

To start addressing the drug combination problem, let us assume we count with a stock of drugs to target different strains that can be found in the patient population. The strains are characterized, in principle, by a different response to the drugs in our stock. Our goal is to find a minimal set of drugs, taken from the available stock, such that each of the strains will respond well to at least one drug in our set.

This problem is better understood using the graph representation in Fig. Fig.1.1. We use one class of vertices (squares) to represent the strains and another class (circles) to represent the drugs. Whenever a strain responds well to a drug we draw an edge between the vertices representing them. In the following we refer to this as the strain-drug response graph. The drug vertices are further divided into covered (filled circles), meaning that they form part of the drug cocktail under consideration, and uncovered (empty circles) otherwise. Now our problem can be rephrased as: determine the minimal number of covered circles (drugs) such that each square (strain) is connected to at least one covered circle, and find such a set (or sets) with a minimal number of drugs. The latter problem is known in the mathematical literature as the *minimal hitting set *problem [7], with strains representing sets and drugs representing set elements.

**Strain-drug response graph and the hitting set problem**. A strain-drug response graph with squares representing strains, circles representing drugs, and edges representing a good response of the strain at one end to the drug at the other end. Covered circles

**...**

Let us show how this work in a specific example. The NCI60 is a program developed by the NCI/NIH aiming the discovery of new chemotherapeutical agents to treat cancer [2]. Their drug stock is made of above 100,000 compounds and response data for 40,000 compounds is publicly available. Their population of cancer cell lines (the strains in this context) is made of 60 tumor derived cell lines, representing nine tissues of origin. The cell lines response to the chemical agents is quantified by the IC50, the drug concentration necessary to inhibit the growth of a exposed cell line culture to 50% relative to the untreated control.

To determine what constitutes a good response we use as a reference the IC50 distribution over all pairs (cell line, drug), after performing a z-transformation of the IC50s in a logarithmic scale (Fig. (Fig.1a,1a, solid line). This reference distribution peaks at zero and decays very fast beyond two standard deviations. Values to the left denote small sensitivity – bad response – and values to the right denote high sensitivity -good response. In the following we assume as a good response positive values above two standard deviations (Fig. (Fig.1a,1a, dashed line). Applying this criteria to each pair of (cell line, drug) we obtain a graph equivalent to that in Fig. Fig.11 for the NCI60 system.

### Finding minimal hitting sets

Having constructed the strain-drug response graph we proceed to identify minimal hitting sets. The hitting set is a computationally hard problem [7]. There is no efficient algorithm to solve it in all possible instances. Yet, using current heuristic algorithms we can estimate the size of the minimal hitting set [8]. In the NCI60 case study, we observe there are some drugs connected to 30 or more cell lines (Fig. (Fig.2b2b).

**NCI60 case study**. a) Distribution of the normalized IC50 for three different chemical agents (bars) and the same distribution for all (cell line, drug) pairs (solid line). Δlog

_{10}IC50 denotes the log

_{10}IC50 change relative to the drug dependent

**...**

Covering any of these drugs will automatically reduce to half the size of our computational problem. Thus, we first use a greedy algorithm, first reported in [9], that recursively covers and removes a drug randomly selected among those drugs with the current highest number of connections, until there are no more samples connected to drugs (Methods, highest-degree-first).

Using the greedy algorithm we obtain a hitting set with three drugs. Now three is a sufficiently small number to attempt an exhaustive test of all combinations of one, two and three drugs. In this way we found no hitting sets with one or two drugs, and a total of 14 minimal hitting sets with three drugs (Table (Table1).1). The 14 minimal hitting sets were also found using a simulated annealing algorithm (Methods, simulated annealing). The simulated annealing algorithm results in a significant reduction in running time of the NCI60 analysis, from several days to one day in a Desktop computer. It may be used to uncover minimal hitting sets in more computationally demanding problems, where exhaustive test is unfeasible. Fig. Fig.2c2c shows the graph associated with one of the solutions. It is made of an antimetabolite (NSC174121, methotrexate derivative), a mTOR inhibitor (NSC606698, rapamycin) and a compound of unknown mechanism of action (NSC671526), where NSC stands for cancer chemotherapy National Service Center number. Among the cell lines, 37 out of 60 are covered by more than one drug. Furthermore, the methotrexate derivative is the drug covering more cell lines. This three drug combination looks promising since mTOR inhibitors have been recently shown to work synergistically with methotrexate in the treatment of lymphoblastic leukemia [10]. Further work is required, however, to determine the contribution of the third drug (NSC671526), with currently unknown mechanism of action. Most of the components of the other hitting sets have unknown mechanisms of action as well (Table (Table2).2). This is the case for the most recurrent compounds NSC676495 and NSC692745, appearing together in 9 out of the 14 hitting sets. While waiting for further study, our analysis suggests that these are putative effective drug cocktails for anticancer therapy.

## Discussion and conclusion

Exhaustive screening of all possible drug combinations is an ineffective strategy to identify good drug combinations. Current screens for single drugs should help to anticipate potentially effective drug combinations, allowing us to narrow down from a see of drug combinations to a short list. The latter can be subject to direct testing, but now with a dramatic decrease of the screening costs.

The strain-drug response graph and the associated minimal hitting set problem provides a systematic framework to tackle this problem. The single agent screen data is represented by a bipartite graph, with a class of vertices representing drugs and another representing malignant agents/strains. Furthermore, the good response of a strain to a drug is represented by a connection between the corresponding vertices in the graph. Using this construction as input, we can search for effective drug combinations, defined as minimal set of drugs such that each strain responds well to at least one drug. The latter problem is mapped to the minimal hitting set problem in mathematics.

The analysis of the NCI60 anticancer drug screen shows how these ideas can be implemented in practice. In this specific example it was possible to identify all minimal hitting sets by exhaustive evaluation of all combinations up to three drug cocktails. An approximate algorithm based on simulated annealing was able to identify all minimal hitting sets as well. The latter algorithm is far more efficient and could be used in problems that are more computationally demanding, with a larger drug stuck or a potentially larger number of drugs in the minimal hitting sets.

The strain-drug response graph and the associated hitting set problem have some caveats. From the technical point of view, we may encounter situations where not all drug-strain pairs have been tested, resulting in an incomplete drug response graph. In this scenario the minimal hitting set size estimated from the incomplete drug-response graph represents and upper bound. This is illustrated in Fig. Fig.33 for the NCI60 analysis. As anticipated above, the estimated minimal hitting set size increases with decreasing the percent of strain-drug pairs tested.

**Minimal hitting sets for incomplete drug-response graphs**. When information about the response of some strains to some drugs is unavailable the strain-drug response graph is incomplete. This could result in an overestimate of the size of the minimal hitting

**...**

The exhaustive search is not a feasible strategy for very large datasets. Therefore, even when the strain-drug response graph is complete, we would rely on approximate algorithms to obtain an upper bound to the minimal hitting set size. Besides the highest-degree-first and simulated annealing algorithms discussed here, there are other heuristic algorithms [8,11] that in some specific problems may result in better estimates.

From the biological point of view, the identified drug combinations are minimal hitting sets for the NCI60 panel of cell lines. A cell line not included in this panel may not respond well to any of these combinations. Furthermore, using the single drug response data we cannot anticipate potential interactions between the drugs in a given minimal set. Finally, we have not addressed other important issues such as toxicity which may exclude a drug combination for clinical use.

In spite of these caveats, the strain-drug response graph and the associated minimal hitting set problem provide a solid mathematical foundation to the drug combination problem. When information is incomplete and the estimates are approximate, it provides an upper bound to the actual minimal hitting set size. It can be applied to larger panels of cancer cell lines to increase the coverage over the population of cancer cell lines. It narrows down to a short list of drug combinations which can be subject to validation, testing combinatorial effects and toxicity.

In a more general perspective, our formulation can also find applications in drug discovery programs targeting viruses with high mutation rates such as HIV. In this context we would require a collection of virus strains found in the patient population, a stuck of antiviral drugs, and a quantitative measure of how well each virus strain responds to each antiviral drug.

## Methods

### NCI60 data

The IC50 data for the NCI60 panel of tumor derived cell lines was obtained from the Developmental Therapeutics Program of NCI/NIH. It consists of IC50 values for 45,344 compounds against the 60 cancer cell lines.

### Highest-degree-first algorithm

Given a strain-drug response graph, start setting all drugs uncovered. Then recursively transform the drugs state and the drug-response graph as follows: (i) Identify the set of drugs having the largest number of connections in the current drug-response graph. If the latter set is made of one drug select that drug. Otherwise, randomly select one of the drugs in the set. (ii) Set that drug covered, remove the drug, all the samples connected to that drug and the edges connecting the drug and the samples. (iii) Stop if the drug-response graph does not contain any samples connected to at least one drug. Otherwise go to step (i). Note: the application of rule (i) introduces randomness in the algorithm and, as a consequence, different runs may result in different outcomes. Specifically, we may obtain different minimal estimated hitting set sizes and/or different hitting sets with the same size. This fact can be exploited by running the algorithm several times and retaining those solutions having the minimum reported hitting set size.

### Simulating annealing algorithm

Given a strain-drug response graph, introduce the state variable *x*_{i}, taking the value *x*_{i }= 1 when element (drug) *i *is covered and 0 otherwise, and the energy or cost function *E *= ∑_{i }*x*_{i }counting the number of covered elements. Proceed as follows: (i) Generate a random set cover and set an initial inverse temperature *β *= *β*_{0}. The random set cover does not need to be of minimal size. We generate it by covering one element (drug) selected at random from each set (strain) with at least one element. (ii) Perform *T*_{eq }equilibration steps. At each step randomly select an element. If it is covered, and uncovering it does not leave uncover any set, then cover it. If it is uncovered, then cover it with probability *e*^{-β}, where *β *is the equivalent of the inverse temperature in physics. (iii) Increase *β*, *β *→ *β *+ Δ*β*, and return to step (ii). Stop the loop when some convergence criteria is satisfied or *β *= *β*_{max}. Note: the generation of the initial state and the application of rule (ii) introduces randomness in the algorithm and, as a consequence, different runs may result in different outcomes. Specifically, we may obtain different estimated minimal hitting set sizes and/or different hitting sets with the same size. This fact can be exploited by running the algorithm several times and retaining those solutions having the minimum reported hitting set size. In the NCI60 study we identified all minimal hitting sets using *β*_{0 }= 0, Δ*β *= 0.1, *β*_{max }= 20, *T*_{eq }= 10 × number of drugs and 1,000 random random covering seeds. A run for each seed took 92 seconds in a 1.86 GHz Desktop computer, 1,000 seeds took 25 and a half hours.

## Authors' contributions

AV conceived and performed the analysis and wrote the manuscript.

## Acknowledgements

Research at the IAS was funded by the Simons Foundation and the Helen and Martin Chooljian Founders' Circle Member.

## References

- Borisy AA, Elliott PJ, Hurst NW, Lee MS, Lehár J, Price ER, Serbedzija G, Zimmermann GR, Foley MA, Stockwell BR, Keith CT. Systematic discovery of multicomponent therapeutics. Proc Natl Acad Sci USA. 2003;100:7977–7982. doi: 10.1073/pnas.1337088100. [PMC free article] [PubMed] [Cross Ref]
- Shoemaker RH. The NCI60 human tumour cell line anticancer drug screen. Nature Rev Cancer. 2006;6:813–823. doi: 10.1038/nrc1951. [PubMed] [Cross Ref]
- wong PK, Yu F, Shahangian A, Cheng G, Sun R, Ho C. Closed-loop control of cellular functions using combinatory grugs guided by a stochastic search algorithm. Proc Natl Acad Sci USA. 2008;105:5105–5110. doi: 10.1073/pnas.0800823105. [PMC free article] [PubMed] [Cross Ref]
- Yildirim MA, Goh KL, Cusick M, Barabási AL, Vidal M. Drug-target network. Nature Biotech. 2007;25:1119–1126. doi: 10.1038/nbt1338. [PubMed] [Cross Ref]
- Nelander S, Wang W, Nilsson B, She QB, Pratilas C, Rosen N, Gennemark P, Sander C. Models from experiments: combinatorial drug perturbations of cancer cells. Mol Syst Biol. 2008;4:216. doi: 10.1038/msb.2008.53. [PMC free article] [PubMed] [Cross Ref]
- Campillo M, Kuhn M, Gavin A, jensen LJ, Bork P. Drug target identification using side effect similarity. Science. 2008;321:263–266. doi: 10.1126/science.1158140. [PubMed] [Cross Ref]
- Garey MR, Johnson DS. Computers and intractability: A guide to the theory of NP-completeness. WH Freeman, New York; 2002.
- Vazirani V. Approximation Algorithms. Springer, Berlin; 2004.
- Johnson DS. Approximation algorithms for combinatorial problems. J Comp Syst Sci. 1974;9:256–278.
- Teachey DT, Sheen C, Hall J, Ryan T, Brown VI, Fish J, Reid GS, Seif AE, Norris R, Chang YJ, Carroll M, Grupp SA. mTOR inhibitors are synergistic with methetrexate: an effective combination to treat acute lymphoblastic leukemia. Blood. 2008;112:2020–2023. doi: 10.1182/blood-2008-02-137141. [PMC free article] [PubMed] [Cross Ref]
- Mézard M, Tarzia M. Statistical mechanics of the hitting set problem. Phys Rev E. 2007;76:041124. doi: 10.1103/PhysRevE.76.041124. [PubMed] [Cross Ref]

**BioMed Central**

## Formats:

- Article |
- PubReader |
- ePub (beta) |
- PDF (328K)

- A kernelisation approach for multiple d-Hitting Set and its application in optimal multi-drug therapeutic combinations.[PLoS One. 2010]
*Mellor D, Prieto E, Mathieson L, Moscato P.**PLoS One. 2010 Oct 18; 5(10):e13055. Epub 2010 Oct 18.* - Analysis of Food and Drug Administration-approved anticancer agents in the NCI60 panel of human tumor cell lines.[Mol Cancer Ther. 2010]
*Holbeck SL, Collins JM, Doroshow JH.**Mol Cancer Ther. 2010 May; 9(5):1451-60. Epub 2010 May 4.* - JFCR39, a panel of 39 human cancer cell lines, and its application in the discovery and development of anticancer drugs.[Bioorg Med Chem. 2012]
*Kong D, Yamori T.**Bioorg Med Chem. 2012 Mar 15; 20(6):1947-51. Epub 2012 Jan 21.* - Algorithmic guided screening of drug combinations of arbitrary size for activity against cancer cells.[Mol Cancer Ther. 2009]
*Zinner RG, Barrett BL, Popova E, Damien P, Volgin AY, Gelovani JG, Lotan R, Tran HT, Pisano C, Mills GB, et al.**Mol Cancer Ther. 2009 Mar; 8(3):521-32. Epub 2009 Mar 10.* - Evaluating response to antineoplastic drug combinations in tissue culture models.[Methods Mol Med. 2005]
*Reynolds CP, Maurer BJ.**Methods Mol Med. 2005; 110:173-83.*

- Analysis of the Robustness of Network-Based Disease-Gene Prioritization Methods Reveals Redundancy in the Human Interactome and Functional Diversity of Disease-Genes[PLoS ONE. ]
*Guney E, Oliva B.**PLoS ONE. 9(4)e94686* - Network Pharmacology Strategies Toward Multi-Target Anticancer Therapies: From Computational Models to Experimental Design Principles[Current Pharmaceutical Design. 2014]
*Tang J, Aittokallio T.**Current Pharmaceutical Design. 2014 Jan; 20(1)20-36* - Predicting and characterizing selective multiple drug treatments for metabolic diseases and cancer[BMC Systems Biology. ]
*Facchetti G, Zampieri M, Altafini C.**BMC Systems Biology. 6115* - Optimization of personalized therapies for anticancer treatment[BMC Systems Biology. ]
*Vazquez A.**BMC Systems Biology. 731* - Structure and dynamics of molecular networks: A novel paradigm of drug discovery: A comprehensive review[Pharmacology & therapeutics. 2013]
*Csermely P, Korcsmáros T, Kiss HJ, London G, Nussinov R.**Pharmacology & therapeutics. 2013 Jun; 138(3)333-408*

- Optimal drug combinations and minimal hitting setsOptimal drug combinations and minimal hitting setsBMC Systems Biology. 2009; 3()81PMC

Your browsing activity is empty.

Activity recording is turned off.

See more...