294 resultados para gene networks
Resumo:
Background: Sigma factors and the alarmone ppGpp control the allocation of RNA polymerase to promoters under stressful conditions. Both ppGpp and the sigma factor sigma(S) (RpoS) are potentially subject to variability across the species Escherichia coli. To find out the extent of strain variation we measured the level of RpoS and ppGpp using 31 E. coli strains from the ECOR collection and one reference K-12 strain. Results: Nine ECORs had highly deleterious mutations in rpoS, 12 had RpoS protein up to 7-fold above that of the reference strain MG1655 and the remainder had comparable or lower levels. Strain variation was also evident in ppGpp accumulation under carbon starvation and spoT mutations were present in several low-ppGpp strains. Three relationships between RpoS and ppGpp levels were found: isolates with zero RpoS but various ppGpp levels, strains where RpoS levels were proportional to ppGpp and a third unexpected class in which RpoS was present but not proportional to ppGpp concentration. High-RpoS and high-ppGpp strains accumulated rpoS mutations under nutrient limitation, providing a source of polymorphisms. Conclusions: The ppGpp and sigma(S) variance means that the expression of genes involved in translation, stress and other traits affected by ppGpp and/or RpoS are likely to be strain-specific and suggest that influential components of regulatory networks are frequently reset by microevolution. Different strains of E. coli have different relationships between ppGpp and RpoS levels and only some exhibit a proportionality between increasing ppGpp and RpoS levels as demonstrated for E. coli K-12.
Resumo:
A network can be analyzed at different topological scales, ranging from single nodes to motifs, communities, up to the complete structure. We propose a novel approach which extends from single nodes to the whole network level by considering non-overlapping subgraphs (i.e. connected components) and their interrelationships and distribution through the network. Though such subgraphs can be completely general, our methodology focuses on the cases in which the nodes of these subgraphs share some special feature, such as being critical for the proper operation of the network. The methodology of subgraph characterization involves two main aspects: (i) the generation of histograms of subgraph sizes and distances between subgraphs and (ii) a merging algorithm, developed to assess the relevance of nodes outside subgraphs by progressively merging subgraphs until the whole network is covered. The latter procedure complements the histograms by taking into account the nodes lying between subgraphs, as well as the relevance of these nodes to the overall subgraph interconnectivity. Experiments were carried out using four types of network models and five instances of real-world networks, in order to illustrate how subgraph characterization can help complementing complex network-based studies.
Resumo:
In this work an iterative strategy is developed to tackle the problem of coupling dimensionally-heterogeneous models in the context of fluid mechanics. The procedure proposed here makes use of a reinterpretation of the original problem as a nonlinear interface problem for which classical nonlinear solvers can be applied. Strong coupling of the partitions is achieved while dealing with different codes for each partition, each code in black-box mode. The main application for which this procedure is envisaged arises when modeling hydraulic networks in which complex and simple subsystems are treated using detailed and simplified models, correspondingly. The potentialities and the performance of the strategy are assessed through several examples involving transient flows and complex network configurations.
Resumo:
A great part of the interest in complex networks has been motivated by the presence of structured, frequently nonuniform, connectivity. Because diverse connectivity patterns tend to result in distinct network dynamics, and also because they provide the means to identify and classify several types of complex network, it becomes important to obtain meaningful measurements of the local network topology. In addition to traditional features such as the node degree, clustering coefficient, and shortest path, motifs have been introduced in the literature in order to provide complementary descriptions of the network connectivity. The current work proposes a different type of motif, namely, chains of nodes, that is, sequences of connected nodes with degree 2. These chains have been subdivided into cords, tails, rings, and handles, depending on the type of their extremities (e.g., open or connected). A theoretical analysis of the density of such motifs in random and scale-free networks is described, and an algorithm for identifying these motifs in general networks is presented. The potential of considering chains for network characterization has been illustrated with respect to five categories of real-world networks including 16 cases. Several interesting findings were obtained, including the fact that several chains were observed in real-world networks, especially the world wide web, books, and the power grid. The possibility of chains resulting from incompletely sampled networks is also investigated.
Resumo:
The study of spectral behavior of networks has gained enthusiasm over the last few years. In particular, random matrix theory (RMT) concepts have proven to be useful. In discussing transition from regular behavior to fully chaotic behavior it has been found that an extrapolation formula of the Brody type can be used. In the present paper we analyze the regular to chaotic behavior of small world (SW) networks using an extension of the Gaussian orthogonal ensemble. This RMT ensemble, coined the deformed Gaussian orthogonal ensemble (DGOE), supplies a natural foundation of the Brody formula. SW networks follow GOE statistics until a certain range of eigenvalue correlations depending upon the strength of random connections. We show that for these regimes of SW networks where spectral correlations do not follow GOE beyond a certain range, DGOE statistics models the correlations very well. The analysis performed in this paper proves the utility of the DGOE in network physics, as much as it has been useful in other physical systems.
Resumo:
This work clarifies the relation between network circuit (topology) and behaviour (information transmission and synchronization) in active networks, e.g. neural networks. As an application, we show how one can find network topologies that are able to transmit a large amount of information, possess a large number of communication channels, and are robust under large variations of the network coupling configuration. This theoretical approach is general and does not depend on the particular dynamic of the elements forming the network, since the network topology can be determined by finding a Laplacian matrix (the matrix that describes the connections and the coupling strengths among the elements) whose eigenvalues satisfy some special conditions. To illustrate our ideas and theoretical approaches, we use neural networks of electrically connected chaotic Hindmarsh-Rose neurons.
Resumo:
We present a scheme for quasiperfect transfer of polariton states from a sender to a spatially separated receiver, both composed of high-quality cavities filled by atomic samples. The sender and the receiver are connected by a nonideal transmission channel -the data bus- modelled by a network of lossy empty cavities. In particular, we analyze the influence of a large class of data-bus topologies on the fidelity and transfer time of the polariton state. Moreover, we also assume dispersive couplings between the polariton fields and the data-bus normal modes in order to achieve a tunneling-like state transfer. Such a tunneling-transfer mechanism, by which the excitation energy of the polariton effectively does not populate the data-bus cavities, is capable of attenuating appreciably the dissipative effects of the data-bus cavities. After deriving a Hamiltonian for the effective coupling between the sender and the receiver, we show that the decay rate of the fidelity is proportional to a cooperativity parameter that weighs the cost of the dissipation rate against the benefit of the effective coupling strength. The increase of the fidelity of the transfer process can be achieved at the expense of longer transfer times. We also show that the dependence of both the fidelity and the transfer time on the network topology is analyzed in detail for distinct regimes of parameters. It follows that the data-bus topology can be explored to control the time of the state-transfer process.
Resumo:
Large-scale cortical networks exhibit characteristic topological properties that shape communication between brain regions and global cortical dynamics. Analysis of complex networks allows the description of connectedness, distance, clustering, and centrality that reveal different aspects of how the network's nodes communicate. Here, we focus on a novel analysis of complex walks in a series of mammalian cortical networks that model potential dynamics of information flow between individual brain regions. We introduce two new measures called absorption and driftness. Absorption is the average length of random walks between any two nodes, and takes into account all paths that may diffuse activity throughout the network. Driftness is the ratio between absorption and the corresponding shortest path length. For a given node of the network, we also define four related measurements, namely in-and out-absorption as well as in-and out-driftness, as the averages of the corresponding measures from all nodes to that node, and from that node to all nodes, respectively. We find that the cat thalamo-cortical system incorporates features of two classic network topologies, Erdos-Renyi graphs with respect to in-absorption and in-driftness, and configuration models with respect to out-absorption and out-driftness. Moreover, taken together these four measures separate the network nodes based on broad functional roles (visual, auditory, somatomotor, and frontolimbic).
Resumo:
Positional information in developing embryos is specified by spatial gradients of transcriptional regulators. One of the classic systems for studying this is the activation of the hunchback (hb) gene in early fruit fly (Drosophila) segmentation by the maternally-derived gradient of the Bicoid (Bcd) protein. Gene regulation is subject to intrinsic noise which can produce variable expression. This variability must be constrained in the highly reproducible and coordinated events of development. We identify means by which noise is controlled during gene expression by characterizing the dependence of hb mRNA and protein output noise on hb promoter structure and transcriptional dynamics. We use a stochastic model of the hb promoter in which the number and strength of Bcd and Hb (self-regulatory) binding sites can be varied. Model parameters are fit to data from WT embryos, the self-regulation mutant hb(14F), and lacZ reporter constructs using different portions of the hb promoter. We have corroborated model noise predictions experimentally. The results indicate that WT (self-regulatory) Hb output noise is predominantly dependent on the transcription and translation dynamics of its own expression, rather than on Bcd fluctuations. The constructs and mutant, which lack self-regulation, indicate that the multiple Bcd binding sites in the hb promoter (and their strengths) also play a role in buffering noise. The model is robust to the variation in Bcd binding site number across a number of fly species. This study identifies particular ways in which promoter structure and regulatory dynamics reduce hb output noise. Insofar as many of these are common features of genes (e. g. multiple regulatory sites, cooperativity, self-feedback), the current results contribute to the general understanding of the reproducibility and determinacy of spatial patterning in early development.
Resumo:
In this work we investigate knowledge acquisition as performed by multiple agents interacting as they infer, under the presence of observation errors, respective models of a complex system. We focus the specific case in which, at each time step, each agent takes into account its current observation as well as the average of the models of its neighbors. The agents are connected by a network of interaction of Erdos-Renyi or Barabasi-Albert type. First, we investigate situations in which one of the agents has a different probability of observation error (higher or lower). It is shown that the influence of this special agent over the quality of the models inferred by the rest of the network can be substantial, varying linearly with the respective degree of the agent with different estimation error. In case the degree of this agent is taken as a respective fitness parameter, the effect of the different estimation error is even more pronounced, becoming superlinear. To complement our analysis, we provide the analytical solution of the overall performance of the system. We also investigate the knowledge acquisition dynamic when the agents are grouped into communities. We verify that the inclusion of edges between agents (within a community) having higher probability of observation error promotes the loss of quality in the estimation of the agents in the other communities.
Resumo:
Biological neuronal networks constitute a special class of dynamical systems, as they are formed by individual geometrical components, namely the neurons. In the existing literature, relatively little attention has been given to the influence of neuron shape on the overall connectivity and dynamics of the emerging networks. The current work addresses this issue by considering simplified neuronal shapes consisting of circular regions (soma/axons) with spokes (dendrites). Networks are grown by placing these patterns randomly in the two-dimensional (2D) plane and establishing connections whenever a piece of dendrite falls inside an axon. Several topological and dynamical properties of the resulting graph are measured, including the degree distribution, clustering coefficients, symmetry of connections, size of the largest connected component, as well as three hierarchical measurements of the local topology. By varying the number of processes of the individual basic patterns, we can quantify relationships between the individual neuronal shape and the topological and dynamical features of the networks. Integrate-and-fire dynamics on these networks is also investigated with respect to transient activation from a source node, indicating that long-range connections play an important role in the propagation of avalanches.
Resumo:
One important issue implied by the finite nature of real-world networks regards the identification of their more external (border) and internal nodes. The present work proposes a formal and objective definition of these properties, founded on the recently introduced concept of node diversity. It is shown that this feature does not exhibit any relevant correlation with several well-established complex networks measurements. A methodology for the identification of the borders of complex networks is described and illustrated with respect to theoretical (geographical and knitted networks) as well as real-world networks (urban and word association networks), yielding interesting results and insights in both cases.
Resumo:
Background: Schistosoma mansoni is the major causative agent of schistosomiasis. The parasite takes advantage of host signals to complete its development in the human body. Tumor necrosis factor-alpha (TNF-alpha) is a human cytokine involved in skin inflammatory responses, and although its effect on the adult parasite's metabolism and egg-laying process has been previously described, a comprehensive assessment of the TNF-alpha pathway and its downstream molecular effects is lacking. Methodology/Principal Findings: In the present work we describe a possible TNF-alpha receptor (TNFR) homolog gene in S. mansoni (SmTNFR). SmTNFR encodes a complete receptor sequence composed of 599 amino acids, and contains four cysteine-rich domains as described for TNFR members. Real-time RT-PCR experiments revealed that SmTNFR highest expression level is in cercariae, 3.5 (+/- 0.7) times higher than in adult worms. Downstream members of the known human TNF-alpha pathway were identified by an in silico analysis, revealing a possible TNF-alpha signaling pathway in the parasite. In order to simulate parasite's exposure to human cytokine during penetration of the skin, schistosomula were exposed to human TNF-alpha just 3 h after cercariae-to-schistosomula in vitro transformation, and large-scale gene expression measurements were performed with microarrays. A total of 548 genes with significantly altered expression were detected, when compared to control parasites. In addition, treatment of adult worms with TNF-alpha caused a significantly altered expression of 1857 genes. Interestingly, the set of genes altered in adults is different from that of schistosomula, with 58 genes in common, representing 3% of altered genes in adults and 11% in 3 h-old early schistosomula. Conclusions/Significance: We describe the possible molecular elements and targets involved in human TNF-alpha effect on S. mansoni, highlighting the mechanism by which recently transformed schistosomula may sense and respond to this host mediator at the site of cercarial penetration into the skin.
Resumo:
Diffuse infiltrating gliomas are the most common tumors of the central nervous system. Gliomas are classified by the WHO according to their histopathological and clinical characteristics into four classes: grade I (pilocytic astrocytoma), grade II (diffuse astrocytoma), grade III (anaplastic astrocytoma), and grade IV (glioblastoma multiforme). Several genes have already been correlated with astrocytomas, but many others are yet to be uncovered. By analyzing the public SAGE data from 21 patients, comprising low malignant grade astrocytomas and glioblastomas, we found COL6A1 to be differentially expressed, confirming this finding by real time RT-PCR in 66 surgical samples. To the best of our knowledge, COL6A1 has never been described in gliomas. The expression of this gene has significantly different means when normal glia is compared with low-grade astrocytomas (grades I and II) and high-grade astrocytomas (grades III and IV), with a tendency to be greater in higher grade samples, thus rendering it a powerful tumor marker.
Resumo:
Background -: Beta-2 adrenergic receptor gene polymorphisms Gln27Glu, Arg16Gly and Thr164Ile were suggested to have an effect in heart failure. We evaluated these polymorphisms relative to clinical characteristics and prognosis of alarge cohort of patients with heart failure of different etiologies. Methods -: We studied 501 patients with heart failure of different etiologies. Mean age was 58 years (standard deviation 14.4 years), 298 (60%) were men. Polymorphisms were identified by polymerase chain reaction-restriction fragment length polymorphism. Results -: During the mean follow-up of 12.6 months (standard deviation 10.3 months), 188 (38%) patients died. Distribution of genotypes of polymorphism Arg16Gly was different relative to body mass index (chi(2) = 9.797; p = 0.04). Overall the probability of survival was not significantly predicted by genotypes of Gln27Glu, Arg16Gly, or Thr164Ile. Allele and haplotype analysis also did not disclose any significant difference regarding mortality. Exploratory analysis through classification trees pointed towards a potential association between the Gln27Glu polymorphism and mortality in older individuals. Conclusion -: In this study sample, we were not able to demonstrate an overall influence of polymorphisms Gln27Glu and Arg16Gly of beta-2 receptor gene on prognosis. Nevertheless, Gln27Glu polymorphism may have a potential predictive value in older individuals.