Drug discovery in a multidimensional world: systems, patterns, and networks.

Program in Biomedical Informatics, Stanford University School of Medicine, Stanford, CA, USA.
Journal of Cardiovascular Translational Research (Impact Factor: 2.69). 10/2010; 3(5):438-47. DOI: 10.1007/s12265-010-9214-6
Source: PubMed

ABSTRACT Despite great strides in revealing and understanding the physiological and molecular bases of cardiovascular disease, efforts to translate this understanding into needed therapeutic interventions continue to lag far behind the initial discoveries. Although pharmaceutical companies continue to increase investments into research and development, the number of drugs gaining federal approval is in decline. Many factors underlie these trends, and a vast number of technological and scientific innovations are being sought through efforts to reinvigorate drug discovery pipelines. Recent advances in molecular profiling technologies and development of sophisticated computational approaches for analyzing these data are providing new, systems-oriented approaches towards drug discovery. Unlike the traditional approach to drug discovery which is typified by a one-drug-one-target mindset, systems-oriented approaches to drug discovery leverage the parallelism and high-dimensionality of the molecular data to construct more comprehensive molecular models that aim to model broader bimolecular systems. These models offer a means to explore complex molecular states (e.g., disease) where thousands to millions of molecular entities comprising multiple molecular data types (e.g., proteomics and gene expression) can be evaluated simultaneously as components of a cohesive biomolecular system. In this paper, we discuss emerging approaches towards systems-oriented drug discovery and contrast these efforts with the traditional, unidimensional approach to drug discovery. We also highlight several applications of these system-oriented approaches across various aspects of drug discovery, including target discovery, drug repositioning and drug toxicity. When available, specific applications to cardiovascular drug discovery are highlighted and discussed.

  • [Show abstract] [Hide abstract]
    ABSTRACT: In the past decade there has been an explosion in genetic research that has resulted in the generation of enormous quantities of disease-related data. In the current study, we have compiled disease risk gene variant information and Electronic Medical Record (EMR) classification codes from various repositories for 305 diseases. Using such data, we developed a pipeline to test for clinical prevalence, gene-variant overlap, and literature presence for all 46,360 unique diseases pairs. To determine whether disease pairs were enriched we systematically employed both Fishers' Exact (medical and literature) and Term Frequency-Inverse Document Frequency (genetics) methodologies to test for enrichment, defining statistical significance at a Bonferonni adjusted threshold of (p < 1×10-6) and weighted q<0.05 accordingly. We hypothesize that disease pairs that are statistically enriched in medical and genetic spheres, but not so in the literature have the potential to reveal non-obvious connections between clinically disparate phenotypes. Using this pipeline, we identified 2,316 disease pairs that were significantly enriched within an EMR and 213 enriched genetically. Of these, 65 disease pairs were statistically enriched in both, 19 of which are believed to be novel. These identified non-obvious relationships between disease pairs are suggestive of a shared underlying etiology with clinical presentation. Further investigation of uncovered disease-pair relationships has the potential to provide insights into the architecture of complex diseases, and update existing knowledge of risk factors.
    Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing 01/2015; 20:407-18.
  • [Show abstract] [Hide abstract]
    ABSTRACT: In most biological systems, second messengers and their key regulatory and effector proteins form links between multiple cellular signaling pathways. Such signaling nodes can integrate the deleterious effects of genetic aberrations, environmental stressors, or both in complex diseases, leading to cell death by various mechanisms. Here we present a systems (network) pharmacology approach that, together with transcriptomics analyses, was used to identify different G protein-coupled receptors that experimentally protected against cellular stress and death caused by linked signaling mechanisms. We describe the application of this concept to degenerative and diabetic retinopathies in appropriate mouse models as an example. Systems pharmacology also provides an attractive framework for devising strategies to combat complex diseases by using (repurposing) US Food and Drug Administration-approved pharmacological agents. Expected final online publication date for the Annual Review of Pharmacology and Toxicology Volume 56 is January 06, 2016. Please see for revised estimates.
    Annual Review of Pharmacology 03/2015; 56(1). DOI:10.1146/annurev-pharmtox-010715-103033 · 18.52 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Throughout the last years, optimization problems on a large number of variables, sometimes over 1000, are becoming common. Thus, algorithms that can tackle them effectively, both in result quality and run time, are necessary. Among these specific algorithms for high-dimensional problems, memetic algorithms, which are the result of the hybridization of an evolutionary algorithm and a local improvement technique, have arisen as very powerful optimization systems for this type of problems. A very effective algorithm of this kind is the MA-SW-Chains algorithm. On the other hand, general purpose computing using Graphics Processing Units (GPUs) has become a very active field because of the high speed-up ratios that can be obtained when applied to problems that exhibit a high degree of data parallelism. In this work we present a new design of MA-SW-Chains to adapt it to the GPU-based massively parallel architecture. The experiments with the new GPU memetic technique, compared to the original sequential version, prove that the results are obtained with the same quality but with a reduction of the run time of two orders of magnitude. This great improvement in computing time makes our proposal suitable for future optimization problems with a dimensionality several orders of magnitude greater than current high-dimensionality standards (i.e. problems with millions of variables). The remarkable run time reduction comes at the cost of a higher design and implementation overhead compared to the CPU-based single-threaded counterpart.
    Information Sciences 02/2015; 293:35–58. DOI:10.1016/j.ins.2014.09.018 · 3.89 Impact Factor