29,307 research outputs found
Examination of the relationship between essential genes in PPI network and hub proteins in reverse nearest neighbor topology
Abstract Background In many protein-protein interaction (PPI) networks, densely connected hub proteins are more likely to be essential proteins. This is referred to as the "centrality-lethality rule", which indicates that the topological placement of a protein in PPI network is connected with its biological essentiality. Though such connections are observed in many PPI networks, the underlying topological properties for these connections are not yet clearly understood. Some suggested putative connections are the involvement of essential proteins in the maintenance of overall network connections, or that they play a role in essential protein clusters. In this work, we have attempted to examine the placement of essential proteins and the network topology from a different perspective by determining the correlation of protein essentiality and reverse nearest neighbor topology (RNN). Results The RNN topology is a weighted directed graph derived from PPI network, and it is a natural representation of the topological dependences between proteins within the PPI network. Similar to the original PPI network, we have observed that essential proteins tend to be hub proteins in RNN topology. Additionally, essential genes are enriched in clusters containing many hub proteins in RNN topology (RNN protein clusters). Based on these two properties of essential genes in RNN topology, we have proposed a new measure; the RNN cluster centrality. Results from a variety of PPI networks demonstrate that RNN cluster centrality outperforms other centrality measures with regard to the proportion of selected proteins that are essential proteins. We also investigated the biological importance of RNN clusters. Conclusions This study reveals that RNN cluster centrality provides the best correlation of protein essentiality and placement of proteins in PPI network. Additionally, merged RNN clusters were found to be topologically important in that essential proteins are significantly enriched in RNN clusters, and biologically important because they play an important role in many Gene Ontology (GO) processes.http://deepblue.lib.umich.edu/bitstream/2027.42/78257/1/1471-2105-11-505.xmlhttp://deepblue.lib.umich.edu/bitstream/2027.42/78257/2/1471-2105-11-505-S1.DOChttp://deepblue.lib.umich.edu/bitstream/2027.42/78257/3/1471-2105-11-505.pdfPeer Reviewe
The Energy Landscape, Folding Pathways and the Kinetics of a Knotted Protein
The folding pathway and rate coefficients of the folding of a knotted protein
are calculated for a potential energy function with minimal energetic
frustration. A kinetic transition network is constructed using the discrete
path sampling approach, and the resulting potential energy surface is
visualized by constructing disconnectivity graphs. Owing to topological
constraints, the low-lying portion of the landscape consists of three distinct
regions, corresponding to the native knotted state and to configurations where
either the N- or C-terminus is not yet folded into the knot. The fastest
folding pathways from denatured states exhibit early formation of the
N-terminus portion of the knot and a rate-determining step where the C-terminus
is incorporated. The low-lying minima with the N-terminus knotted and the
C-terminus free therefore constitute an off-pathway intermediate for this
model. The insertion of both the N- and C-termini into the knot occur late in
the folding process, creating large energy barriers that are the rate limiting
steps in the folding process. When compared to other protein folding proteins
of a similar length, this system folds over six orders of magnitude more
slowly.Comment: 19 page
A circuit topology approach to categorizing changes in biomolecular structure
The biological world is composed of folded linear molecules of bewildering topological complexity and diversity. The topology of folded biomolecules such as proteins and ribonucleic acids is often subject to change during biological processes. Despite intense research, we lack a solid mathematical framework that summarizes these operations in a principled manner. Circuit topology, which formalizes the arrangements of intramolecular contacts, serves as a general mathematical framework to analyze the topological characteristics of folded linear molecules. In this work, we translate familiar molecular operations in biology, such as duplication, permutation, and elimination of contacts, into the language of circuit topology. We show that for such operations there are corresponding matrix representations as well as basic rules that serve as a foundation for understanding these operations within the context of a coherent algebraic framework. We present several biological examples and provide a simple computational framework for creating and analyzing the circuit diagrams of proteins and nucleic acids. We expect our study and future developments in this direction to facilitate a deeper understanding of natural molecular processes and to provide guidance to engineers for generating complex polymeric materials
Graph Theory and Networks in Biology
In this paper, we present a survey of the use of graph theoretical techniques
in Biology. In particular, we discuss recent work on identifying and modelling
the structure of bio-molecular networks, as well as the application of
centrality measures to interaction networks and research on the hierarchical
structure of such networks and network motifs. Work on the link between
structural network properties and dynamics is also described, with emphasis on
synchronization and disease propagation.Comment: 52 pages, 5 figures, Survey Pape
Recommended from our members
A computer system to perform structure comparison using TOPS representations of protein structure
We describe the design and implementation of a fast topology–based method
for protein structure comparison. The approach uses the TOPS topological representation
of protein structure, aligning two structures using a common discovered
pattern and generating measure of distance derived from an insert score. Heavy
use is made of a constraint-based pattern matching algorithm for TOPS diagrams
that we have designed and described elsewhere Gilbert et al. (1999). The comparison
system is maintained at the European Bioinformatics Institute and is available
over the Web via the at tops.ebi.ac.uk/tops. Users submit a structure description in
Protein Data Bank (PDB) format and can compare it with structures in the entire
PDB or a representative subset of protein domains, receiving the results by email
Hidden geometric correlations in real multiplex networks
Real networks often form interacting parts of larger and more complex
systems. Examples can be found in different domains, ranging from the Internet
to structural and functional brain networks. Here, we show that these multiplex
systems are not random combinations of single network layers. Instead, they are
organized in specific ways dictated by hidden geometric correlations between
the individual layers. We find that these correlations are strong in different
real multiplexes, and form a key framework for answering many important
questions. Specifically, we show that these geometric correlations facilitate:
(i) the definition and detection of multidimensional communities, which are
sets of nodes that are simultaneously similar in multiple layers; (ii) accurate
trans-layer link prediction, where connections in one layer can be predicted by
observing the hidden geometric space of another layer; and (iii) efficient
targeted navigation in the multilayer system using only local knowledge, which
outperforms navigation in the single layers only if the geometric correlations
are sufficiently strong. Our findings uncover fundamental organizing principles
behind real multiplexes and can have important applications in diverse domains.Comment: Supplementary Materials available at
http://www.nature.com/nphys/journal/v12/n11/extref/nphys3812-s1.pd
- …