Search PubMed⌕ Search

SEARCH · Search PubMed

Results for “Networks”

Search indexed PubMed citations on genomics, clinical trials, systematic reviews and public health. Explore titles, authors and supplied subject terms, then open the PubMed record.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,567 records · Page 87Linked to original sources

On embedding synfire chains in a balanced network.

We investigate the formation of synfire waves in a balanced network of integrate-and-fire neurons. The synaptic connectivity of this network embodies synfire chains within a sparse random connectivity. This network can exhibit global oscillations but can also operate in an asynchronous activity mode. We analyze the correlations of two neurons in a pool as convenient indicators for the state of the network. We find, using different models, that these indicators depend on a scaling variable. Beyond a critical point, strong correlations and large network oscillations are obtained. We looked for the conditions under which a synfire wave could be propagated on top of an otherwise asynchronous state of the network. This condition was found to be highly restrictive, requiring a large number of neurons for its implementation in our network. The results are based on analytic derivations and simulations.

Computer Simulation↗

Network random keys - a tree representation scheme for genetic and evolutionary algorithms.

When using genetic and evolutionary algorithms for network design, choosing a good representation scheme for the construction of the genotype is important for algorithm performance. One of the most common representation schemes for networks is the characteristic vector representation. However, with encoding trees, and using crossover and mutation, invalid individuals occur that are either under- or over-specified. When constructing the offspring or repairing the invalid individuals that do not represent a tree, it is impossible to distinguish between the importance of the links that should be used. These problems can be overcome by transferring the concept of random keys from scheduling and ordering problems to the encoding of trees. This paper investigates the performance of a simple genetic algorithm (SGA) using network random keys (NetKeys) for the one-max tree and a real-world problem. The comparison between the network random keys and the characteristic vector encoding shows that despite the effects of stealth mutation, which favors the characteristic vector representation, selectorecombinative SGAs with NetKeys have some advantages for small and easy optimization problems. With more complex problems, SGAs with network random keys significantly outperform SGAs using characteristic vectors. This paper shows that random keys can be used for the encoding of trees, and that genetic algorithms using network random keys are able to solve complex tree problems much faster than when using the characteristic vector. Users should therefore be encouraged to use network random keys for the representation of trees.

Algorithms↗

Quantitative and qualitative aspects of the social network in schizophrenic patients living in the community. Relationship to sociodemographic characteristics and clinical factors and subjective quality of life.

Quantitative and qualitative aspects of the social network were investigated in a sample of 120 schizophrenic out-patients. Sociodemographic and clinical factors as well as subjective quality of life were investigated as to their relationship to the social network. The Interview Schedule for Social Integration (ISSI) was used to assess social network and Lancashire Quality of Life Profile was used to assess subjective quality of life. Psychopathology was measured by BPRS and psychosocial functioning by GAF. The patients reported a significantly worse social network compared to a normal sample both regarding quantitative and qualitative aspects of the network. Almost half of the patients wanted access to more social contacts. Relatives and friends turned out to be the patient's main source of supportive contacts. More severe negative and positive symptoms were related to a worse social network. Support was found for an association between characteristics of the social network, such as satisfaction with social contacts, and quality of life. The results give reason to suggest that the care system should consider the informal caregivers' situation and focus on interventions, which enhance the patient's satisfaction with social contacts.

Adult↗

The association of gender, sibling network composition, and patterns of parent care by adult children.

Based on matched data from the 1982 National Long-Term Care Survey and the National Survey of Informal Caregivers, this article explores the degree to which separating adult children (N = 3,742) by the composition of their sibling network (i.e., only children, single-gender networks, and mixed-gender networks) provides insight into the association between gender and patterns of parent-care. Caregiving participation was calculated as a proportion of the availability of all children of a specific gender. The data reveal that, within all sibling network categories, daughters were more likely than sons to be providing care to an impaired parent; however, the repercussions of being a caregiver were not similarly uniform. Specifically, sons and daughters from only-child and single-gender networks reported a similar number of hours per day spent in parent-care and experienced comparable levels of stress and burden. In contrast, daughters from mixed-gender networks reported significantly higher levels of stress and burden and more hours per day spent caregiving than sons. These findings demonstrate that differentiating children by sibling network type does offer some clarity to our understanding of the complex association between gender and patterns of parent-care.

Activities of Daily Living↗

Social network characteristics and psychological well-being: a replication and extension.

This article represents a replication and extension of a previous study by Israel and her colleagues that investigated the relationship between psychological well-being and social network characteristics. The present research included both a comparable sample of white women (N = 104) between the ages of 60 and 68 (as in the original study), and a more extensive adult population of men and women (N = 718) between the ages of 50 and 95. The network characteristics examined are categorized along three broad dimensions: Structure--linkages in the overall network (size and density); interaction--nature of the linkages themselves (frequency, geographic dispersion, and reciprocity); and functions that networks provide (affective support and instrumental support). The results indicate a predominance of comparable findings for both the replication and extension studies. Of the eight network characteristics examined, the results of five of the regression analyses were the same across all three studies. The network characteristics of size, density, geographic dispersion, reciprocal instrumental support, and instrumental support did not make a significant contribution to the variance in psychological well-being. Of the other three network characteristics, the effect of frequency of interaction varied across the studies, and a pattern of significant results was found for affective support and reciprocal affective support. A discussion of this evidence in light of current literature and implications for practice and research is included.

Aged↗

Commensurate distances and similar motifs in genetic congruence and protein interaction networks in yeast.

BACKGROUND: In a genetic interaction, the phenotype of a double mutant differs from the combined phenotypes of the underlying single mutants. When the single mutants have no growth defect, but the double mutant is lethal or exhibits slow growth, the interaction is termed synthetic lethality or synthetic fitness. These genetic interactions reveal gene redundancy and compensating pathways. Recently available large-scale data sets of genetic interactions and protein interactions in Saccharomyces cerevisiae provide a unique opportunity to elucidate the topological structure of biological pathways and how genes function in these pathways. RESULTS: We have defined congruent genes as pairs of genes with similar sets of genetic interaction partners and constructed a genetic congruence network by linking congruent genes. By comparing path lengths in three types of networks (genetic interaction, genetic congruence, and protein interaction), we discovered that high genetic congruence not only exhibits correlation with direct protein interaction linkage but also exhibits commensurate distance with the protein interaction network. However, consistent distances were not observed between genetic and protein interaction networks. We also demonstrated that congruence and protein networks are enriched with motifs that indicate network transitivity, while the genetic network has both transitive (triangle) and intransitive (square) types of motifs. These results suggest that robustness of yeast cells to gene deletions is due in part to two complementary pathways (square motif) or three complementary pathways, any two of which are required for viability (triangle motif). CONCLUSION: Genetic congruence is superior to genetic interaction in prediction of protein interactions and function associations. Genetically interacting pairs usually belong to parallel compensatory pathways, which can generate transitive motifs (any two of three pathways needed) or intransitive motifs (either of two pathways needed).

Protein Interaction Mapping↗

VANTED: a system for advanced data analysis and visualization in the context of biological networks.

BACKGROUND: Recent advances with high-throughput methods in life-science research have increased the need for automatized data analysis and visual exploration techniques. Sophisticated bioinformatics tools are essential to deduct biologically meaningful interpretations from the large amount of experimental data, and help to understand biological processes. RESULTS: We present VANTED, a tool for the visualization and analysis of networks with related experimental data. Data from large-scale biochemical experiments is uploaded into the software via a Microsoft Excel-based form. Then it can be mapped on a network that is either drawn with the tool itself, downloaded from the KEGG Pathway database, or imported using standard network exchange formats. Transcript, enzyme, and metabolite data can be presented in the context of their underlying networks, e. g. metabolic pathways or classification hierarchies. Visualization and navigation methods support the visual exploration of the data-enriched networks. Statistical methods allow analysis and comparison of multiple data sets such as different developmental stages or genetically different lines. Correlation networks can be automatically generated from the data and substances can be clustered according to similar behavior over time. As examples, metabolite profiling and enzyme activity data sets have been visualized in different metabolic maps, correlation networks have been generated and similar time patterns detected. Some relationships between different metabolites were discovered which are in close accordance with the literature. CONCLUSION: VANTED greatly helps researchers in the analysis and interpretation of biochemical data, and thus is a useful tool for modern biological research. VANTED as a Java Web Start Application including a user guide and example data sets is available free of charge at http://vanted.ipk-gatersleben.de.

Algorithms↗

Low degree metabolites explain essential reactions and enhance modularity in biological networks.

BACKGROUND: Recently there has been a lot of interest in identifying modules at the level of genetic and metabolic networks of organisms, as well as in identifying single genes and reactions that are essential for the organism. A goal of computational and systems biology is to go beyond identification towards an explanation of specific modules and essential genes and reactions in terms of specific structural or evolutionary constraints. RESULTS: In the metabolic networks of Escherichia coli, Saccharomyces cerevisiae and Staphylococcus aureus, we identified metabolites with a low degree of connectivity, particularly those that are produced and/or consumed in just a single reaction. Using flux balance analysis (FBA) we also determined reactions essential for growth in these metabolic networks. We find that most reactions identified as essential in these networks turn out to be those involving the production or consumption of low degree metabolites. Applying graph theoretic methods to these metabolic networks, we identified connected clusters of these low degree metabolites. The genes involved in several operons in E. coli are correctly predicted as those of enzymes catalyzing the reactions of these clusters. Furthermore, we find that larger sized clusters are over-represented in the real network and are analogous to a 'network motif. Using FBA for the above mentioned three organisms we independently identified clusters of reactions whose fluxes are perfectly correlated. We find that the composition of the latter 'functional clusters' is also largely explained in terms of clusters of low degree metabolites in each of these organisms. CONCLUSION: Our findings mean that most metabolic reactions that are essential can be tagged by one or more low degree metabolites. Those reactions are essential because they are the only ways of producing or consuming their respective tagged metabolites. Furthermore, reactions whose fluxes are strongly correlated can be thought of as 'glued together' by these low degree metabolites. The methods developed here could be used in predicting essential reactions and metabolic modules in other organisms from the list of metabolic reactions.

Bacteria↗

Identification of QTLs controlling gene expression networks defined a priori.

BACKGROUND: Gene expression microarrays allow the quantification of transcript accumulation for many or all genes in a genome. This technology has been utilized for a range of investigations, from assessments of gene regulation in response to genetic or environmental fluctuation to global expression QTL (eQTL) analyses of natural variation. Current analysis techniques facilitate the statistical querying of individual genes to evaluate the significance of a change in response, also known as differential expression. Since genes are also known to respond as groups due to their membership in networks, effective approaches are needed to investigate transcriptome variation as related to gene network responses. RESULTS: We describe a statistical approach that is capable of assessing higher-order a priori defined gene network response, as measured by microarrays. This analysis detected significant network variation between two Arabidopsis thaliana accessions, Bay-0 and Shahdara. By extending this approach, we were able to identify eQTLs controlling network responses for 18 out of 20 a priori-defined gene networks in a recombinant inbred line population derived from accessions Bay-0 and Shahdara. CONCLUSION: This approach has the potential to be expanded to facilitate direct tests of the relationship between phenotypic trait and transcript genetic architecture. The use of a priori definitions for network eQTL identification has enormous potential for providing direction toward future eQTL analyses.

Arabidopsis↗

Rapid and asymmetric divergence of duplicate genes in the human gene coexpression network.

BACKGROUND: While gene duplication is known to be one of the most common mechanisms of genome evolution, the fates of genes after duplication are still being debated. In particular, it is presently unknown whether most duplicate genes preserve (or subdivide) the functions of the parental gene or acquire new functions. One aspect of gene function, that is the expression profile in gene coexpression network, has been largely unexplored for duplicate genes. RESULTS: Here we build a human gene coexpression network using human tissue-specific microarray data and investigate the divergence of duplicate genes in it. The topology of this network is scale-free. Interestingly, our analysis indicates that duplicate genes rapidly lose shared coexpressed partners: after approximately 50 million years since duplication, the two duplicate genes in a pair have only slightly higher number of shared partners as compared with two random singletons. We also show that duplicate gene pairs quickly acquire new coexpressed partners: the average number of partners for a duplicate gene pair is significantly greater than that for a singleton (the latter number can be used as a proxy of the number of partners for a parental singleton gene before duplication). The divergence in gene expression between two duplicates in a pair occurs asymmetrically: one gene usually has more partners than the other one. The network is resilient to both random and degree-based in silico removal of either singletons or duplicate genes. In contrast, the network is especially vulnerable to the removal of highly connected genes when duplicate genes and singletons are considered together. CONCLUSION: Duplicate genes rapidly diverge in their expression profiles in the network and play similar role in maintaining the network robustness as compared with singletons.

Chromosome Mapping↗

Inferring topology from clustering coefficients in protein-protein interaction networks.

BACKGROUND: Although protein-protein interaction networks determined with high-throughput methods are incomplete, they are commonly used to infer the topology of the complete interactome. These partial networks often show a scale-free behavior with only a few proteins having many and the majority having only a few connections. Recently, the possibility was suggested that this scale-free nature may not actually reflect the topology of the complete interactome but could also be due to the error proneness and incompleteness of large-scale experiments. RESULTS: In this paper, we investigate the effect of limited sampling on average clustering coefficients and how this can help to more confidently exclude possible topology models for the complete interactome. Both analytical and simulation results for different network topologies indicate that partial sampling alone lowers the clustering coefficient of all networks tremendously. Furthermore, we extend the original sampling model by also including spurious interactions via a preferential attachment process. Simulations of this extended model show that the effect of wrong interactions on clustering coefficients depends strongly on the skewness of the original topology and on the degree of randomness of clustering coefficients in the corresponding networks. CONCLUSION: Our findings suggest that the complete interactome is either highly skewed such as e.g. in scale-free networks or is at least highly clustered. Although the correct topology of the interactome may not be inferred beyond any reasonable doubt from the interaction networks available, a number of topologies can nevertheless be excluded with high confidence.

Cluster Analysis↗

Algebraic comparison of metabolic networks, phylogenetic inference, and metabolic innovation.

BACKGROUND: Comparison of metabolic networks is typically performed based on the organisms' enzyme contents. This approach disregards functional replacements as well as orthologies that are misannotated. Direct comparison of the structure of metabolic networks can circumvent these problems. RESULTS: Metabolic networks are naturally represented as directed hypergraphs in such a way that metabolites are nodes and enzyme-catalyzed reactions form (hyper)edges. The familiar operations from set algebra (union, intersection, and difference) form a natural basis for both the pairwise comparison of networks and identification of distinct metabolic features of a set of algorithms. We report here on an implementation of this approach and its application to the procaryotes. CONCLUSION: We demonstrate that metabolic networks contain valuable phylogenetic information by comparing phylogenies obtained from network comparisons with 16S RNA phylogenies. The algebraic approach to metabolic networks is suitable to study metabolic innovations in two sets of organisms, free living microbes and Pyrococci, as well as obligate intracellular pathogens.

Algorithms↗

Comparative analysis of the Saccharomyces cerevisiae and Caenorhabditis elegans protein interaction networks.

BACKGROUND: Protein interaction networks aim to summarize the complex interplay of proteins in an organism. Early studies suggested that the position of a protein in the network determines its evolutionary rate but there has been considerable disagreement as to what extent other factors, such as protein abundance, modify this reported dependence. RESULTS: We compare the genomes of Saccharomyces cerevisiae and Caenorhabditis elegans with those of closely related species to elucidate the recent evolutionary history of their respective protein interaction networks. Interaction and expression data are studied in the light of a detailed phylogenetic analysis. The underlying network structure is incorporated explicitly into the statistical analysis. The increased phylogenetic resolution, paired with high-quality interaction data, allows us to resolve the way in which protein interaction network structure and abundance of proteins affect the evolutionary rate. We find that expression levels are better predictors of the evolutionary rate than a protein's connectivity. Detailed analysis of the two organisms also shows that the evolutionary rates of interacting proteins are not sufficiently similar to be mutually predictive. CONCLUSION: It appears that meaningful inferences about the evolution of protein interaction networks require comparative analysis of reasonably closely related species. The signature of protein evolution is shaped by a protein's abundance in the organism and its function and the biological process it is involved in. Its position in the interaction networks and its connectivity may modulate this but they appear to have only minor influence on a protein's evolutionary rate.

Animals↗

Characterization of the GATC regulatory network in E. coli.

BACKGROUND: The tetranucleotide GATC is methylated in Escherichia. coli by the DNA methyltransferase (Dam) and is known to be implicated in numerous cellular processes. Mutants lacking Dam are characterized by a pleiotropic phenotype. The existence of a GATC regulated network, thought to be involved in cold and oxygen shift, had been proposed and its existence has recently been confirmed. The aim of this article is to describe the components of the GATC regulated network of E. coli in detail and propose a role of this network in the light of an evolutionary advantage for the organism. RESULTS: We have classified the genes of the GATC network according to the EcoCyc functional classes. Comparisons with all of E. coli's genes and the genes involved in the SOS and stress response show that the GATC network forms a group apart. The functional classes that characterize the network are the Energy metabolism (in particular respiration), Fatty acid/ Phospholipid metabolism and Nucleotide metabolism. CONCLUSIONS: The network is thought to come into play when the cell undergoes coldshock and is likely to enter stationary phase.The respiration is almost completely under GATC control and according to our hypothesis it will be blocked at the moment of coldshock; this might give the cell a selective advantage as it increases its chances for survival when entering stationary phase under coldshock. We predict the accumulation of formate and possibly succinate, which might increase the cell's resistance, in this case to antimicrobial agents, when entering stationary phase.

Biological Evolution↗

The DtxR protein acting as dual transcriptional regulator directs a global regulatory network involved in iron metabolism of Corynebacterium glutamicum.

BACKGROUND: The knowledge about complete bacterial genome sequences opens the way to reconstruct the qualitative topology and global connectivity of transcriptional regulatory networks. Since iron is essential for a variety of cellular processes but also poses problems in biological systems due to its high toxicity, bacteria have evolved complex transcriptional regulatory networks to achieve an effective iron homeostasis. Here, we apply a combination of transcriptomics, bioinformatics, in vitro assays, and comparative genomics to decipher the regulatory network of the iron-dependent transcriptional regulator DtxR of Corynebacterium glutamicum. RESULTS: A deletion of the dtxR gene of C. glutamicum ATCC 13032 led to the mutant strain C. glutamicum IB2103 that was able to grow in minimal medium only under low-iron conditions. By performing genome-wide DNA microarray hybridizations, differentially expressed genes involved in iron metabolism of C. glutamicum were detected in the dtxR mutant. Bioinformatics analysis of the genome sequence identified a common 19-bp motif within the upstream region of 31 genes, whose differential expression in C. glutamicum IB2103 was verified by real-time reverse transcription PCR. Binding of a His-tagged DtxR protein to oligonucleotides containing the 19-bp motifs was demonstrated in vitro by DNA band shift assays. At least 64 genes encoding a variety of physiological functions in iron transport and utilization, in central carbohydrate metabolism and in transcriptional regulation are controlled directly by the DtxR protein. A comparison with the bioinformatically predicted networks of C. efficiens, C. diphtheriae and C. jeikeium identified evolutionary conserved elements of the DtxR network. CONCLUSION: This work adds considerably to our currrent understanding of the transcriptional regulatory network of C. glutamicum genes that are controlled by DtxR. The DtxR protein has a major role in controlling the expression of genes involved in iron metabolism and exerts a dual regulatory function as repressor of genes participating in iron uptake and utilization and as activator of genes responsible for iron storage and DNA protection. The data suggest that the DtxR protein acts as global regulator by controlling the expression of other regulatory proteins that might take care of an iron-dependent regulation of a broader transcriptional network of C. glutamicum genes.

Bacterial Proteins↗

CoryneRegNet: an ontology-based data warehouse of corynebacterial transcription factors and regulatory networks.

BACKGROUND: The application of DNA microarray technology in post-genomic analysis of bacterial genome sequences has allowed the generation of huge amounts of data related to regulatory networks. This data along with literature-derived knowledge on regulation of gene expression has opened the way for genome-wide reconstruction of transcriptional regulatory networks. These large-scale reconstructions can be converted into in silico models of bacterial cells that allow a systematic analysis of network behavior in response to changing environmental conditions. DESCRIPTION: CoryneRegNet was designed to facilitate the genome-wide reconstruction of transcriptional regulatory networks of corynebacteria relevant in biotechnology and human medicine. During the import and integration process of data derived from experimental studies or literature knowledge CoryneRegNet generates links to genome annotations, to identified transcription factors and to the corresponding cis-regulatory elements. CoryneRegNet is based on a multi-layered, hierarchical and modular concept of transcriptional regulation and was implemented by using the relational database management system MySQL and an ontology-based data structure. Reconstructed regulatory networks can be visualized by using the yFiles JAVA graph library. As an application example of CoryneRegNet, we have reconstructed the global transcriptional regulation of a cellular module involved in SOS and stress response of corynebacteria. CONCLUSION: CoryneRegNet is an ontology-based data warehouse that allows a pertinent data management of regulatory interactions along with the genome-scale reconstruction of transcriptional regulatory networks. These models can further be combined with metabolic networks to build integrated models of cellular function including both metabolism and its transcriptional regulation.

Computer Graphics↗

Gene connectivity, function, and sequence conservation: predictions from modular yeast co-expression networks.

BACKGROUND: Genes and proteins are organized into functional modular networks in which the network context of a gene or protein has implications for cellular function. Highly connected hub proteins, largely responsible for maintaining network connectivity, have been found to be much more likely to be essential for yeast survival. RESULTS: Here we investigate the properties of weighted gene co-expression networks formed from multiple microarray datasets. The constructed networks approximate scale-free topology, but this is not universal across all datasets. We show strong positive correlations between gene connectivity within the whole network and gene essentiality as well as gene sequence conservation. We demonstrate the preservation of a modular structure of the networks formed, and demonstrate that, within some of these modules, it is possible to observe a strong correlation between connectivity and essentiality or between connectivity and conservation within the modules particularly within modules containing larger numbers of essential genes. CONCLUSION: Application of these techniques can allow a finer scale prediction of relative gene importance for a particular process within a group of similarly expressed genes.

Base Sequence↗

Differential evolutionary conservation of motif modes in the yeast protein interaction network.

BACKGROUND: The importance of a network motif (a recurring interconnected pattern of special topology which is over-represented in a biological network) lies in its position in the hierarchy between the protein molecule and the module in a protein-protein interaction network. Until now, however, the methods available have greatly restricted the scope of research. While they have focused on the analysis in the resolution of a motif topology, they have not been able to distinguish particular motifs of the same topology in a protein-protein interaction network. RESULTS: We have been able to assign the molecular function annotations of Gene Ontology to each protein in the protein-protein interactions of Saccharomyces cerevisiae. For various motif topologies, we have developed an algorithm, enabling us to unveil one million "motif modes", each of which features a unique topological combination of molecular functions. To our surprise, the conservation ratio, i.e., the extent of the evolutionary constraints upon the motif modes of the same motif topology, varies significantly, clearly indicative of distinct differences in the evolutionary constraints upon motifs of the same motif topology. Equally important, for all motif modes, we have found a power-law distribution of the motif counts on each motif mode. We postulate that motif modes may very well represent the evolutionary-conserved topological units of a protein interaction network. CONCLUSION: For the first time, the motifs of a protein interaction network have been investigated beyond the scope of motif topology. The motif modes determined in this study have not only enabled us to differentiate among different evolutionary constraints on motifs of the same topology but have also opened up new avenues through which protein interaction networks can be analyzed.

Algorithms↗