No Arabic abstract
The evolution, regulation and sustenance of biological complexity is determined by protein-protein interaction network that is filled with dynamic events. Recent experimental evidences point out that clustering of proteins has a vital role in many cellular processes. Upsurge in fluorescence imaging methods has given a new spin to our ability to probe protein interactions in cellular and sub-cellular compartments. Despite the increasing detection sensitivity, quantitative information that can be obtained from these imaging methods is limited. This is primarily due to (i) the difficulty in tracking the problem analytically and (ii) limitations in spatio-temporal resolution that can be achieved in interrogating living cells in real time. A novel point of view based on diffusion-driven percolative clustering is proposed here that can plausibly shed more light on the complex issues of protein-protein interactions. Since this model is open to computational analysis, it is quantitative in its premise. Besides being able to analyze the phenomenon, the power of any model is gauged by its ability to predict interesting and novel features of the phenomenon itself, which can subsequently be tested by additional experiments. To this end, an experimental assay based on fluorescence lifetime imaging is proposed to verify the validity of the percolation model.
Various biological sensory systems exhibit a response to a relative change of the stimulus, often referred to as fold-change detection. In the last few years fold-change detecting mechanisms, based on transcriptional networks, have been proposed. Here we present fold-change detecting mechanism, based on protein-protein interactions, consisting of two interacting proteins. This mechanism, in contrast to previously proposed mechanisms, does not consume chemical energy and is not subject to transcriptional and translational noise. We show by analytical and numerical calculations, that the mechanism can have a fast, precise and efficient response for parameters that are relevant to eukaryotic cells.
In protein-protein interaction networks certain topological properties appear to be recurrent: networks maps are considered scale-free. It is possible that this topology is reflected in the protein structure. In this paper we investigate the role of protein disorder in the network topology. We find that the disorder of a protein (or of its neighbors) is independent of its number of protein-protein interactions. This result suggests that protein disorder does not play a role in the scale-free architecture of protein networks.
Recently, the structural controllability theory has been introduced to analyze the Protein-Protein Interaction (PPI) network. The indispensable nodes, which their removal increase the number of driver nodes to control the network, are found essential in PPI network. However, the PPI network is far from complete and there may exist many false-positive or false-negative interactions, which promotes us to question: are these indispensable nodes robust to structural change? Here we systematically investigate the robustness of indispensable nodes of PPI network by removing and adding possible interactions. We found that the indispensable nodes are sensitive to the structural change and very few edges can change the type of many indispensable nodes. The finding may promote our understanding to the control principle of PPI network.
Motivation: High-throughput experimental techniques have been producing more and more protein-protein interaction (PPI) data. PPI network alignment greatly benefits the understanding of evolutionary relationship among species, helps identify conserved sub-networks and provides extra information for functional annotations. Although a few methods have been developed for multiple PPI network alignment, the alignment quality is still far away from perfect and thus, new network alignment methods are needed. Result: In this paper, we present a novel method, denoted as ConvexAlign, for joint alignment of multiple PPI networks by convex optimization of a scoring function composed of sequence similarity, topological score and interaction conservation score. In contrast to existing methods that generate multiple alignments in a greedy or progressive manner, our convex method optimizes alignments globally and enforces consistency among all pairwise alignments, resulting in much better alignment quality. Tested on both synthetic and real data, our experimental results show that ConvexAlign outperforms several popular methods in producing functionally coherent alignments. ConvexAlign even has a larger advantage over the others in aligning real PPI networks. ConvexAlign also finds a few conserved complexes among 5 species which cannot be detected by the other methods.
Temperature sensing is a ubiquitous cell behavior, but the fundamental limits to the precision of temperature sensing are poorly understood. Unlike in chemical concentration sensing, the precision of temperature sensing is not limited by extrinsic fluctuations in the temperature field itself. Instead, we find that precision is limited by the intrinsic copy number, turnover, and binding kinetics of temperature-sensitive proteins. Developing a model based on the canonical TlpA protein, we find that a cell can estimate temperature to within 2%. We compare this prediction with in vivo data on temperature sensing in bacteria.