DocumentCode :
3542459
Title :
Efficient combinatorial drug optimization through stochastic search
Author :
Kim, Mansuck ; Yoon, Byung-Jun
Author_Institution :
Dept. of Electr. & Comput. Eng., Texas A&M Univ., College Station, TX, USA
fYear :
2011
fDate :
4-6 Dec. 2011
Firstpage :
33
Lastpage :
35
Abstract :
Multi-target therapeutics has been shown to be effective for treating complex diseases. In this paper, we propose a novel stochastic search algorithm that can be effectively used for combinatorial drug optimization. The proposed algorithm aims to enhance existing drug optimization, including the Gur Game algorithm, where the key of the proposed approach lies in utilizing a reference concentration to decide how to update a given drug combination to improve the drug response. We demonstrate that the proposed algorithm outperforms the existing algorithms, in terms of both efficiency and success rate.
Keywords :
combinatorial mathematics; diseases; drugs; search problems; stochastic games; Gur game algorithm; combinatorial drug optimization; complex diseases; drug response improvement; multitarget therapeutics; reference concentration utilization; stochastic search algorithm; Algorithm design and analysis; Bioinformatics; Diseases; Drugs; Games; Optimization; Signal processing algorithms; Combinatorial drug optimization; multi-target therapeutics; stochastic search algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Genomic Signal Processing and Statistics (GENSIPS), 2011 IEEE International Workshop on
Conference_Location :
San Antonio, TX
ISSN :
2150-3001
Print_ISBN :
978-1-4673-0491-7
Electronic_ISBN :
2150-3001
Type :
conf
DOI :
10.1109/GENSiPS.2011.6169434
Filename :
6169434
Link To Document :
بازگشت