A Diverse Stochastic Search Algorithm for Combination Therapeutics

Background. Design of drug combination cocktails to maximize sensitivity for individual patients presents a challenge in terms of minimizing the number of experiments to attain the desired objective. The enormous number of possible drug combinations constrains exhaustive experimentation approaches,...

Full description

Bibliographic Details
Main Authors: Mehmet Umut Caglar, Ranadip Pal
Format: Article
Language:English
Published: Hindawi Limited 2014-01-01
Series:BioMed Research International
Online Access:http://dx.doi.org/10.1155/2014/873436
id doaj-c2ba108d6c8c487e8a21e866f28d5d23
record_format Article
spelling doaj-c2ba108d6c8c487e8a21e866f28d5d232020-11-24T20:45:49ZengHindawi LimitedBioMed Research International2314-61332314-61412014-01-01201410.1155/2014/873436873436A Diverse Stochastic Search Algorithm for Combination TherapeuticsMehmet Umut Caglar0Ranadip Pal1Department of Physics, Texas Tech University, P.O. Box 41051, Lubbock, TX 79409, USADepartment of Electrical and Computer Engineering, Texas Tech University, P.O. Box 43102, Lubbock, TX 79409, USABackground. Design of drug combination cocktails to maximize sensitivity for individual patients presents a challenge in terms of minimizing the number of experiments to attain the desired objective. The enormous number of possible drug combinations constrains exhaustive experimentation approaches, and personal variations in genetic diseases restrict the use of prior knowledge in optimization. Results. We present a stochastic search algorithm that consisted of a parallel experimentation phase followed by a combination of focused and diversified sequential search. We evaluated our approach on seven synthetic examples; four of them were evaluated twice with different parameters, and two biological examples of bacterial and lung cancer cell inhibition response to combination drugs. The performance of our approach as compared to recently proposed adaptive reference update approach was superior for all the examples considered, achieving an average of 45% reduction in the number of experimental iterations. Conclusions. As the results illustrate, the proposed diverse stochastic search algorithm can produce optimized combinations in relatively smaller number of iterative steps. This approach can be combined with available knowledge on the genetic makeup of the patient to design optimal selection of drug cocktails.http://dx.doi.org/10.1155/2014/873436
collection DOAJ
language English
format Article
sources DOAJ
author Mehmet Umut Caglar
Ranadip Pal
spellingShingle Mehmet Umut Caglar
Ranadip Pal
A Diverse Stochastic Search Algorithm for Combination Therapeutics
BioMed Research International
author_facet Mehmet Umut Caglar
Ranadip Pal
author_sort Mehmet Umut Caglar
title A Diverse Stochastic Search Algorithm for Combination Therapeutics
title_short A Diverse Stochastic Search Algorithm for Combination Therapeutics
title_full A Diverse Stochastic Search Algorithm for Combination Therapeutics
title_fullStr A Diverse Stochastic Search Algorithm for Combination Therapeutics
title_full_unstemmed A Diverse Stochastic Search Algorithm for Combination Therapeutics
title_sort diverse stochastic search algorithm for combination therapeutics
publisher Hindawi Limited
series BioMed Research International
issn 2314-6133
2314-6141
publishDate 2014-01-01
description Background. Design of drug combination cocktails to maximize sensitivity for individual patients presents a challenge in terms of minimizing the number of experiments to attain the desired objective. The enormous number of possible drug combinations constrains exhaustive experimentation approaches, and personal variations in genetic diseases restrict the use of prior knowledge in optimization. Results. We present a stochastic search algorithm that consisted of a parallel experimentation phase followed by a combination of focused and diversified sequential search. We evaluated our approach on seven synthetic examples; four of them were evaluated twice with different parameters, and two biological examples of bacterial and lung cancer cell inhibition response to combination drugs. The performance of our approach as compared to recently proposed adaptive reference update approach was superior for all the examples considered, achieving an average of 45% reduction in the number of experimental iterations. Conclusions. As the results illustrate, the proposed diverse stochastic search algorithm can produce optimized combinations in relatively smaller number of iterative steps. This approach can be combined with available knowledge on the genetic makeup of the patient to design optimal selection of drug cocktails.
url http://dx.doi.org/10.1155/2014/873436
work_keys_str_mv AT mehmetumutcaglar adiversestochasticsearchalgorithmforcombinationtherapeutics
AT ranadippal adiversestochasticsearchalgorithmforcombinationtherapeutics
AT mehmetumutcaglar diversestochasticsearchalgorithmforcombinationtherapeutics
AT ranadippal diversestochasticsearchalgorithmforcombinationtherapeutics
_version_ 1716813950684758016