اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدHow the global structure of protein interaction networks evolves
180
0
0.0
(
0
)
تأليف
A. Wagner
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Two processes can influence the evolution of protein interaction networks: addition and elimination of interactions between proteins, and gene duplications increasing the number of proteins and interactions. The rates of these processes can be estimated from available Saccharomyces cerevisiae genome data and are sufficiently high to affect network structure on short time scales. For instance, more than 100 interactions may be added to the yeast network every million years, a substantial fraction of which adds previously unconnected proteins to the network. Highly connected proteins show a greater rate of interaction turnover than proteins with few interactions. From these observations one can explain ? without natural selection on global network structure ? the evolutionary sustenance of the most prominent network feature, the distribution of the frequency P(d) of proteins with d neighbors, which is a broad-tailed distribution. This distribution is independent of the experimental approach providing nformation on network structure.
قيم البحث
اقرأ أيضاً
The determination of protein functions is one of the most challenging problems of the post-genomic era. The sequencing of entire genomes and the possibility to access genes co-expression patterns has moved the attention from the study of single prote
ins or small complexes to that of the entire proteome. In this context, the search for reliable methods for proteins function assignment is of uttermost importance. Previous approaches to deduce the unknown function of a class of proteins have exploited sequence similarities or clustering of co-regulated genes, phylogenetic profiles, protein-protein interactions, and protein complexes. We propose to assign functional classes to proteins from their network of physical interactions, by minimizing the number of interacting proteins with different categories. The function assignment is made on a global scale and depends on the entire connectivity pattern of the protein network. Multiple functional assignments are made possible as a consequence of the existence of multiple equivalent solutions. The method is applied to the yeast Saccharomices Cerevisiae protein-protein interaction network. Robustness is tested in presence of a high percentage of unclassified proteins and under deletion/insertion of interactions.
From social interactions to the human brain, higher-order networks are key to describe the underlying network geometry and topology of many complex systems. While it is well known that network structure strongly affects its function, the role that ne
twork topology and geometry has on the emerging dynamical properties of higher-order networks is yet to be clarified. In this perspective, the spectral dimension plays a key role since it determines the effective dimension for diffusion processes on a network. Despite its relevance, a theoretical understanding of which mechanisms lead to a finite spectral dimension, and how this can be controlled, represents nowadays still a challenge and is the object of intense research. Here we introduce two non-equilibrium models of hyperbolic higher-order networks and we characterize their network topology and geometry by investigating the interwined appearance of small-world behavior, $delta$-hyperbolicity and community structure. We show that different topological moves determining the non-equilibrium growth of the higher-order hyperbolic network models induce tunable values of the spectral dimension, showing a rich phenomenology which is not displayed in random graph ensembles. In particular, we observe that, if the topological moves used to construct the higher-order network increase the area$/$volume ratio, the spectral dimension continuously decreases, while the opposite effect is observed if the topological moves decrease the area$/$volume ratio. Our work reveals a new link between the geometry of a network and its diffusion properties, contributing to a better understanding of the complex interplay between network structure and dynamics.
Aligning protein-protein interaction (PPI) networks of different species has drawn a considerable interest recently. This problem is important to investigate evolutionary conserved pathways or protein complexes across species, and to help in the iden
tification of functional orthologs through the detection of conserved interactions. It is however a difficult combinatorial problem, for which only heuristic methods have been proposed so far. We reformulate the PPI alignment as a graph matching problem, and investigate how state-of-the-art graph matching algorithms can be used for that purpose. We differentiate between two alignment problems, depending on whether strict constraints on protein matches are given, based on sequence similarity, or whether the goal is instead to find an optimal compromise between sequence similarity and interaction conservation in the alignment. We propose new methods for both cases, and assess their performance on the alignment of the yeast and fly PPI networks. The new methods consistently outperform state-of-the-art algorithms, retrieving in particular 78% more conserved interactions than IsoRank for a given level of sequence similarity. Availability:http://cbio.ensmp.fr/proj/graphm_ppi/, additional data and codes are available upon request. Contact: [email protected]
We study the time until first occurrence, the first-passage time, of rare density fluctuations in diffusive systems. We approach the problem using a model consisting of many independent random walkers on a lattice. The existence of spatial correlatio
ns makes this problem analytically intractable. However, for a mean-field approximation in which the walkers can jump anywhere in the system, we obtain a simple asymptotic form for the mean first-passage time to have a given number k of particles at a distinguished site. We show numerically, and argue heuristically, that for large enough k, the mean-field results give a good approximation for first-passage times for systems with nearest-neighbour dynamics, especially for two and higher spatial dimensions. Finally, we show how the results change when density fluctuations anywhere in the system, rather than at a specific distinguished site, are considered.
The method of iterated conformal maps allows to study the harmonic measure of Diffusion Limited Aggregates with unprecedented accuracy. We employ this method to explore the multifractal properties of the measure, including the scaling of the measure
in the deepest fjords that were hitherto screened away from any numerical probing. We resolve probabilities as small as $10^{-35}$, and present an accurate determination of the generalized dimensions and the spectrum of singularities. We show that the generalized dimensions $D_q$ are infinite for $q<q^*$, where $q^*$ is of the order of -0.2. In the language of $f(alpha)$ this means that $alpha_{max}$ is finite. The $f(alpha)$ curve loses analyticity (the phenomenon of phase transition) at $alpha_{max}$ and a finite value of $f(alpha_{max})$. We consider the geometric structure of the regions that support the lowest parts of the harmonic measure, and thus offer an explanation for the phase transition, rationalizing the value of $q^*$ and $f(alpha_{max})$. We thus offer a satisfactory physical picture of the scaling properties of this multifractal measure.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
