15,671 research outputs found
Allo-network drugs: Extension of the allosteric drug concept to protein-protein interaction and signaling networks
Allosteric drugs are usually more specific and have fewer side effects than orthosteric drugs targeting the same
protein. Here, we overview the current knowledge on allosteric signal transmission from the network point of view, and show that most intra-protein conformational changes may be dynamically transmitted across protein-protein interaction and signaling networks of the cell. Allo-network drugs influence the pharmacological target protein indirectly using specific inter-protein network pathways. We show that allo-network drugs may have a higher efficiency to change the networks of human cells than those of other organisms, and can be designed to have specific effects on cells in a diseased state. Finally, we summarize possible methods to identify allo-network drug targets and sites, which may develop to a promising new area of systems-based drug design
Finding undetected protein associations in cell signaling by belief propagation
External information propagates in the cell mainly through signaling cascades
and transcriptional activation, allowing it to react to a wide spectrum of
environmental changes. High throughput experiments identify numerous molecular
components of such cascades that may, however, interact through unknown
partners. Some of them may be detected using data coming from the integration
of a protein-protein interaction network and mRNA expression profiles. This
inference problem can be mapped onto the problem of finding appropriate optimal
connected subgraphs of a network defined by these datasets. The optimization
procedure turns out to be computationally intractable in general. Here we
present a new distributed algorithm for this task, inspired from statistical
physics, and apply this scheme to alpha factor and drug perturbations data in
yeast. We identify the role of the COS8 protein, a member of a gene family of
previously unknown function, and validate the results by genetic experiments.
The algorithm we present is specially suited for very large datasets, can run
in parallel, and can be adapted to other problems in systems biology. On
renowned benchmarks it outperforms other algorithms in the field.Comment: 6 pages, 3 figures, 1 table, Supporting Informatio
Connecting Seed Lists of Mammalian Proteins Using Steiner Trees
Multivariate experiments and genomics studies applied to mammalian cells often produce lists of genes or proteins altered under treatment/disease vs. control/normal conditions. Such lists can be identified in known protein-protein interaction networks to produce subnetworks that “connect” the genes or proteins from the lists. Such subnetworks are valuable for biologists since they can suggest regulatory mechanisms that are altered under different conditions. Often such subnetworks are overloaded with links and nodes resulting in connectivity diagrams that are illegible due to edge overlap. In this study, we attempt to address this problem by implementing an approximation to the Steiner Tree problem to connect seed lists of mammalian proteins/genes using literature-based protein-protein interaction networks. To avoid over-representation of hubs in the resultant Steiner Trees we assign a cost to Steiner Vertices based on their connectivity degree. We applied the algorithm to lists of genes commonly mutated in colorectal cancer to demonstrate the usefulness of this approach
Structural Prediction of Protein–Protein Interactions by Docking: Application to Biomedical Problems
A huge amount of genetic information is available thanks to the recent advances in sequencing technologies and the larger computational capabilities, but the interpretation of such genetic data at phenotypic level remains elusive. One of the reasons is that proteins are not acting alone, but are specifically interacting with other proteins and biomolecules, forming intricate interaction networks that are essential for the majority of cell processes and pathological conditions. Thus, characterizing such interaction networks is an important step in understanding how information flows from gene to phenotype. Indeed, structural characterization of protein–protein interactions at atomic resolution has many applications in biomedicine, from diagnosis and vaccine design, to drug discovery. However, despite the advances of experimental structural determination, the number of interactions for which there is available structural data is still very small. In this context, a complementary approach is computational modeling of protein interactions by docking, which is usually composed of two major phases: (i) sampling of the possible binding modes between the interacting molecules and (ii) scoring for the identification of the correct orientations. In addition, prediction of interface and hot-spot residues is very useful in order to guide and interpret mutagenesis experiments, as well as to understand functional and mechanistic aspects of the interaction. Computational docking is already being applied to specific biomedical problems within the context of personalized medicine, for instance, helping to interpret pathological mutations involved in protein–protein interactions, or providing modeled structural data for drug discovery targeting protein–protein interactions.Spanish Ministry of Economy grant number BIO2016-79960-R; D.B.B. is supported by a
predoctoral fellowship from CONACyT; M.R. is supported by an FPI fellowship from the
Severo Ochoa program. We are grateful to the Joint BSC-CRG-IRB Programme in
Computational Biology.Peer ReviewedPostprint (author's final draft
Network-based stratification of tumor mutations.
Many forms of cancer have multiple subtypes with different causes and clinical outcomes. Somatic tumor genome sequences provide a rich new source of data for uncovering these subtypes but have proven difficult to compare, as two tumors rarely share the same mutations. Here we introduce network-based stratification (NBS), a method to integrate somatic tumor genomes with gene networks. This approach allows for stratification of cancer into informative subtypes by clustering together patients with mutations in similar network regions. We demonstrate NBS in ovarian, uterine and lung cancer cohorts from The Cancer Genome Atlas. For each tissue, NBS identifies subtypes that are predictive of clinical outcomes such as patient survival, response to therapy or tumor histology. We identify network regions characteristic of each subtype and show how mutation-derived subtypes can be used to train an mRNA expression signature, which provides similar information in the absence of DNA sequence
Large-scale analysis of disease pathways in the human interactome
Discovering disease pathways, which can be defined as sets of proteins
associated with a given disease, is an important problem that has the potential
to provide clinically actionable insights for disease diagnosis, prognosis, and
treatment. Computational methods aid the discovery by relying on
protein-protein interaction (PPI) networks. They start with a few known
disease-associated proteins and aim to find the rest of the pathway by
exploring the PPI network around the known disease proteins. However, the
success of such methods has been limited, and failure cases have not been well
understood. Here we study the PPI network structure of 519 disease pathways. We
find that 90% of pathways do not correspond to single well-connected components
in the PPI network. Instead, proteins associated with a single disease tend to
form many separate connected components/regions in the network. We then
evaluate state-of-the-art disease pathway discovery methods and show that their
performance is especially poor on diseases with disconnected pathways. Thus, we
conclude that network connectivity structure alone may not be sufficient for
disease pathway discovery. However, we show that higher-order network
structures, such as small subgraphs of the pathway, provide a promising
direction for the development of new methods
- …