Adaptive reference update (ARU) algorithm. A stochastic search algorithm for efficient optimization of multi-drug cocktails
<p>Abstract</p> <p>Background</p> <p>Multi-target therapeutics has been shown to be effective for treating complex diseases, and currently, it is a common practice to combine multiple drugs to treat such diseases to optimize the therapeutic outcomes. However, considerin...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2012-10-01
|
Series: | BMC Genomics |
id |
doaj-ffa3abfad1904c57acfd40c3e3a0b559 |
---|---|
record_format |
Article |
spelling |
doaj-ffa3abfad1904c57acfd40c3e3a0b5592020-11-25T01:37:18ZengBMCBMC Genomics1471-21642012-10-0113Suppl 6S1210.1186/1471-2164-13-S6-S12Adaptive reference update (ARU) algorithm. A stochastic search algorithm for efficient optimization of multi-drug cocktailsKim MansuckYoon Byung-Jun<p>Abstract</p> <p>Background</p> <p>Multi-target therapeutics has been shown to be effective for treating complex diseases, and currently, it is a common practice to combine multiple drugs to treat such diseases to optimize the therapeutic outcomes. However, considering the huge number of possible ways to mix multiple drugs at different concentrations, it is practically difficult to identify the optimal drug combination through exhaustive testing.</p> <p>Results</p> <p>In this paper, we propose a novel stochastic search algorithm, called the adaptive reference update (ARU) algorithm, that can provide an efficient and systematic way for optimizing multi-drug cocktails. The ARU algorithm iteratively updates the drug combination to improve its response, where the update is made by comparing the response of the current combination with that of a reference combination, based on which the beneficial update direction is predicted. The reference combination is continuously updated based on the drug response values observed in the past, thereby adapting to the underlying drug response function. To demonstrate the effectiveness of the proposed algorithm, we evaluated its performance based on various multi-dimensional drug functions and compared it with existing algorithms.</p> <p>Conclusions</p> <p>Simulation results show that the ARU algorithm significantly outperforms existing stochastic search algorithms, including the Gur Game algorithm. In fact, the ARU algorithm can more effectively identify potent drug combinations and it typically spends fewer iterations for finding effective combinations. Furthermore, the ARU algorithm is robust to random fluctuations and noise in the measured drug response, which makes the algorithm well-suited for practical drug optimization applications.</p> |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Kim Mansuck Yoon Byung-Jun |
spellingShingle |
Kim Mansuck Yoon Byung-Jun Adaptive reference update (ARU) algorithm. A stochastic search algorithm for efficient optimization of multi-drug cocktails BMC Genomics |
author_facet |
Kim Mansuck Yoon Byung-Jun |
author_sort |
Kim Mansuck |
title |
Adaptive reference update (ARU) algorithm. A stochastic search algorithm for efficient optimization of multi-drug cocktails |
title_short |
Adaptive reference update (ARU) algorithm. A stochastic search algorithm for efficient optimization of multi-drug cocktails |
title_full |
Adaptive reference update (ARU) algorithm. A stochastic search algorithm for efficient optimization of multi-drug cocktails |
title_fullStr |
Adaptive reference update (ARU) algorithm. A stochastic search algorithm for efficient optimization of multi-drug cocktails |
title_full_unstemmed |
Adaptive reference update (ARU) algorithm. A stochastic search algorithm for efficient optimization of multi-drug cocktails |
title_sort |
adaptive reference update (aru) algorithm. a stochastic search algorithm for efficient optimization of multi-drug cocktails |
publisher |
BMC |
series |
BMC Genomics |
issn |
1471-2164 |
publishDate |
2012-10-01 |
description |
<p>Abstract</p> <p>Background</p> <p>Multi-target therapeutics has been shown to be effective for treating complex diseases, and currently, it is a common practice to combine multiple drugs to treat such diseases to optimize the therapeutic outcomes. However, considering the huge number of possible ways to mix multiple drugs at different concentrations, it is practically difficult to identify the optimal drug combination through exhaustive testing.</p> <p>Results</p> <p>In this paper, we propose a novel stochastic search algorithm, called the adaptive reference update (ARU) algorithm, that can provide an efficient and systematic way for optimizing multi-drug cocktails. The ARU algorithm iteratively updates the drug combination to improve its response, where the update is made by comparing the response of the current combination with that of a reference combination, based on which the beneficial update direction is predicted. The reference combination is continuously updated based on the drug response values observed in the past, thereby adapting to the underlying drug response function. To demonstrate the effectiveness of the proposed algorithm, we evaluated its performance based on various multi-dimensional drug functions and compared it with existing algorithms.</p> <p>Conclusions</p> <p>Simulation results show that the ARU algorithm significantly outperforms existing stochastic search algorithms, including the Gur Game algorithm. In fact, the ARU algorithm can more effectively identify potent drug combinations and it typically spends fewer iterations for finding effective combinations. Furthermore, the ARU algorithm is robust to random fluctuations and noise in the measured drug response, which makes the algorithm well-suited for practical drug optimization applications.</p> |
work_keys_str_mv |
AT kimmansuck adaptivereferenceupdatearualgorithmastochasticsearchalgorithmforefficientoptimizationofmultidrugcocktails AT yoonbyungjun adaptivereferenceupdatearualgorithmastochasticsearchalgorithmforefficientoptimizationofmultidrugcocktails |
_version_ |
1725058449092378624 |