A community computational challenge to predict the activity of pairs of compounds
Author(s): Bansal, Mukesh; Yang, Jichen; Karan, Charles; Menden, Michael P; Costello, James C; et al
DownloadTo refer to this page use:
http://arks.princeton.edu/ark:/88435/pr1wg2t
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Bansal, Mukesh | - |
dc.contributor.author | Yang, Jichen | - |
dc.contributor.author | Karan, Charles | - |
dc.contributor.author | Menden, Michael P | - |
dc.contributor.author | Costello, James C | - |
dc.contributor.author | Tang, Hao | - |
dc.contributor.author | Xiao, Guanghua | - |
dc.contributor.author | Li, Yajuan | - |
dc.contributor.author | Allen, Jeffrey | - |
dc.contributor.author | Zhong, Rui | - |
dc.contributor.author | Chen, Beibei | - |
dc.contributor.author | Kim, Minsoo | - |
dc.contributor.author | Wang, Tao | - |
dc.contributor.author | Heiser, Laura M | - |
dc.contributor.author | Realubit, Ronald | - |
dc.contributor.author | Mattioli, Michela | - |
dc.contributor.author | Alvarez, Mariano J | - |
dc.contributor.author | Shen, Yao | - |
dc.contributor.author | NCI-DREAM Community | - |
dc.contributor.author | Gallahan, Daniel | - |
dc.contributor.author | Singer, Dina | - |
dc.contributor.author | Saez-Rodriguez, Julio | - |
dc.contributor.author | Xie, Yang | - |
dc.contributor.author | Stolovitzky, Gustavo | - |
dc.contributor.author | Califano, Andrea | - |
dc.date.accessioned | 2021-10-08T19:47:38Z | - |
dc.date.available | 2021-10-08T19:47:38Z | - |
dc.date.issued | 2014 | en_US |
dc.identifier.citation | Bansal, Mukesh, Jichen Yang, Charles Karan, Michael P. Menden, James C. Costello, Hao Tang, Guanghua Xiao, Yajuan Li, Jeffrey Allen, Rui Zhong, Beibei Chen, Minsoo Kim, Tao Wang, Laura M Heiser, Ronald Realubit, Michela Mattioli, Mariano J Alvarez, Yao Shen, NCI-DREAM Community, Daniel Gallahan, Dinah Singer, Julio Saez-Rodriguez, Yang Xie, Gustavo Stolovitzky, and Andrea Califano. "A community computational challenge to predict the activity of pairs of compounds." Nature Biotechnology 32, no. 12 (2014): 1213-1222. doi:10.1038/nbt.3052 | en_US |
dc.identifier.issn | 1087-0156 | - |
dc.identifier.uri | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4399794/pdf/nihms663971.pdf | - |
dc.identifier.uri | http://arks.princeton.edu/ark:/88435/pr1wg2t | - |
dc.description.abstract | Recent therapeutic successes have renewed interest in drug combinations, but experimental screening approaches are costly and often identify only small numbers of synergistic combinations. The DREAM consortium launched an open challenge to foster the development of in silico methods to computationally rank 91 compound pairs, from the most synergistic to the most antagonistic, based on gene-expression profiles of human B cells treated with individual compounds at multiple time points and concentrations. Using scoring metrics based on experimental dose-response curves, we assessed 32 methods (31 community-generated approaches and SynGen), four of which performed significantly better than random guessing. We highlight similarities between the methods. Although the accuracy of predictions was not optimal, we find that computational prediction of compound-pair activity is possible, and that community challenges can be useful to advance the field of in silico compound-synergy prediction. | en_US |
dc.format.extent | 1213 - 1222 | en_US |
dc.language.iso | en_US | en_US |
dc.relation.ispartof | Nature Biotechnology | en_US |
dc.rights | Author's manuscript | en_US |
dc.title | A community computational challenge to predict the activity of pairs of compounds | en_US |
dc.type | Journal Article | en_US |
dc.identifier.doi | 10.1038/nbt.3052 | - |
dc.identifier.eissn | 1546-1696 | - |
pu.type.symplectic | http://www.symplectic.co.uk/publications/atom-terms/1.0/journal-article | en_US |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
ChallengePredictActivityPairsCompounds.pdf | 581.43 kB | Adobe PDF | View/Download |
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.