Name
Abstract | ||
|---|---|---|
Motivation: Combinatorial therapies play increasingly important roles in combating complex diseases. Owing to the huge cost associated with experimental methods in identifying optimal drug combinations, computational approaches can provide a guide to limit the search space and reduce cost. However, few computational approaches have been developed for this purpose, and thus there is a great need of new algorithms for drug combination prediction. Results: Here we proposed to formulate the optimal combinatorial therapy problem into two complementary mathematical algorithms, Balanced Target Set Cover (BTSC) and Minimum Off-Target Set Cover (MOTSC). Given a disease gene set, BTSC seeks a balanced solution that maximizes the coverage on the disease genes and minimizes the off-target hits at the same time. MOTSC seeks a full coverage on the disease gene set while minimizing the off-target set. Through simulation, both BTSC and MOTSC demonstrated a much faster running time over exhaustive search with the same accuracy. When applied to real disease gene sets, our algorithms not only identified known drug combinations, but also predicted novel drug combinations that are worth further testing. In addition, we developed a web-based tool to allow users to iteratively search for optimal drug combinations given a user-defined gene set. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1093/bioinformatics/btu046 | BIOINFORMATICS |
Field | DocType | Volume |
Data mining,Set cover problem,Software design,Brute-force search,Computer science,Integer programming,Bioinformatics,Gene regulatory network | Journal | 30 |
Issue | ISSN | Citations |
10 | 1367-4803 | 5 |
PageRank | References | Authors |
0.48 | 12 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kaifang Pang | 1 | 38 | 3.36 |
| Ying-Wooi Wan | 2 | 32 | 3.24 |
| William T Choi | 3 | 5 | 0.48 |
| Lawrence A Donehower | 4 | 27 | 2.14 |
| Jingchun Sun | 5 | 227 | 17.08 |
| Dhruv Pant | 6 | 5 | 0.48 |
| Zhandong Liu | 7 | 50 | 7.60 |