Search PubMed⌕ Search

SEARCH · Search PubMed

Results for “Network graphs”

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 163 records · Page 9Linked to original sources
PubMed2006

The interaction networks of structured RNAs.

All pairwise interactions occurring between bases which could be detected in three-dimensional structures of crystallized RNA molecules are annotated on new planar diagrams. The diagrams attempt to map the underlying complex networks of base-base interactions and, especially, they aim at conveying key relationships between helical domains: co-axial stacking, bending and all Watson-Crick as well as non-Watson-Crick base pairs. Although such wiring diagrams cannot replace full stereographic images for correct spatial understanding and representation, they reveal structural similarities as well as the conserved patterns and distances between motifs which are present within the interaction networks of folded RNAs of similar or unrelated functions. Finally, the diagrams could help devising methods for meaningfully transforming RNA structures into graphs amenable to network analysis.

Base Pairing↗
PubMed2006

Network analysis of Danish cattle industry trade patterns as an evaluation of risk potential for disease spread.

Trade patterns of animal movements in a specific industry are complex and difficult to study because there are many stakeholders, premises that are heterogeneously spread over the country, and a highly dynamic flow of animals exists among them. The Danish cattle industry was defined as a network of animal movements and graph theory was used to analyse the movements of cattle within this network. A premise was defined as a farm, an abattoir or a market. These premises constituted the network nodes in the graph and the animal movements between them were the links. In this framework, each premise had a sub-network of other premises to which it was linked by these animal movements. If no movement of animals were registered for a specific farm, then the sub-network for that premise consisted of only that premise. Otherwise, the sub-network linked the premise of interest to all premises from which and to which animals were moved, as long as there was a path linking animal movements to that specific premise. This approach allowed visualization and analyses of four levels of organization that existed in Denmark animal registers: (1) the animal that was moved, (2) the movements of all animals between two premises, (3) the specific premise network, and (4) the overall industry network. When contagious animals are moved from one premise to another, then to a third and so forth, these movements create a path for potential transfer of pathogens. The paths within which pathogens are present identify the transmission risks. A network of animal movements should provide information about pathogen transmission and disease spread. The network of the Danish cattle industry network was a directed scale-free graph (the direction of a movement was known), with an in-degree power of 2 an out-degree power of 1.46, consisted of 29,999 nodes, and 130,265 movements during a 6-month period. The in clustering coefficient was calculated to be 0.52 for the inward direction (movement to), while it was 0.02 for the outward direction (movement from). In Denmark, the cattle movements between premises demonstrated a large degree of heterogeneity. This heterogeneity in movements between farms should be used to evaluate the risk potential of disease transmission for each premise and must be considered when modelling disease spread between premises. The objective of this research was to describe the network of animal movements and not just the animal movements per se.

Animals↗
PubMed1995

The topology of the kinetoplast DNA network.

Kinetoplast DNA (kDNA) of trypanosomatid parasites is a network of approximately 5000 catenated DNA minicircles and approximately 25 maxicircles. We developed the following strategy to deduce the topological linkage of the minicircles of the Crithidia fasciculata network. First, we used graph theory to provide precise models of possible network structures. Second, on the basis of these models, we predicted the frequencies of minicircle oligomers expected from random network breakage. Third, we determined the fragmentation pattern of kDNA networks as a function of the extent of digestion. Fourth, by comparison of the results with the predictions, we identified the model that best represents the network. We conclude that each minicircle is linked on average to three other minicircles. A honeycomb arrangement probably results, with each minicircle typically at the vertex of a hexagonal cell. This topology has implications for the assembly, structure, and function of kDNA networks.

Animals↗
PubMed2005

Synchronization in power-law networks.

We consider realistic power-law graphs, for which the power-law holds only for a certain range of degrees. We show that synchronizability of such networks depends on the expected average and expected maximum degree. In particular, we find that networks with realistic power-law graphs are less synchronizable than classical random networks. Finally, we consider hybrid graphs, which consist of two parts: a global graph and a local graph. We show that hybrid networks, for which the number of global edges is proportional to the number of total edges, almost surely synchronize.

Algorithms↗
PubMed2026

Beyond one-to-one mappings: Modelling distributed lesion-symptom relationships with multilayer networks.

Lesion-symptom mapping is widely used to identify causal relationships between brain structures and behaviour, and has played a central role in neuropsychologically informed network models of cognition. However, even recent approaches remain constrained by a one-to-one mapping framework, which oversimplifies the complex relationships between network-level damage and cognitive deficits. In addition, the non-orthogonality of cortical and white matter damage makes it difficult to disentangle their distinct contributions. Here, we used graph-based multilayer network analysis to address these limitations and evaluate clinical relevance. Using neuroanatomical and longitudinal neuropsychological data from 252 patients who underwent awake neurosurgery for low-grade glioma, we constructed interactive, three-layer networks for each hemisphere. Layer 1 comprised neuropsychological tasks (NT), layer 2 structural disconnections (SD), and layer 3 cortical damage (CD). Nodes represented tasks, white matter tracts, and cortical parcels, respectively, whereas within-layer edges captured correlations in performance or co-occurring damage patterns. Multilayer community detection identified domain- and hemisphere-specific brain-behaviour motifs linking executive, language, and spatial functions to distinct combinations of cortical and white matter disruption, a pattern confirmed by two spatial embedding approaches. Centrality analyses revealed a continuum of mapping relationships, ranging from one-to-one to one-to-many associations, indicating that tasks such as verbal fluency are better explained by multiple disconnection mechanisms. Additional analyses uncovered many-to-one and many-to-many relationships and highlighted tracts and cortical regions with domain-general relevance. Together, these findings support a neurobiologically grounded, network-oriented account of how structural brain damage gives rise to cognitive deficits, with implications for clinical care.

Humans↗
PubMed2000

A gene network inference method from continuous-value gene expression data of wild-type and mutants.

In this paper we introduce a new inference method of a gene regulatory network from steady-state gene expression data. Our method determines a regulatory structure consistent with an observed set of steady-state expression profiles, each generated from wild-type and single deletion mutant of the target network. Our method derives the regulatory relationships in the network using a graph theoretic approach. The advantage of our method is to be able to deal with continuous values of steady-state data, while most of the methods proposed in past use a Boolean network model with binary data. Performance of our method is evaluated on simulated networks with varying the size of networks, indegree of each gene, and the data characteristics (continuous-value/binary), and is compared with that of predictor method proposed by Ideker et al. As a result, we show the superiority of using continuous values to binary values, and the performance of our method is much better than that of the predictor method.

Animals↗
PubMed2023

Towards mechanistic models of mutational effects: Deep learning on Alzheimer's Aβ peptide.

Deep Mutational Scanning (DMS) has enabled multiplexed measurement of mutational effects on protein properties, including kinematics and self-organization, with unprecedented resolution. However, potential bottlenecks of DMS characterization include experimental design, data quality, and depth of mutational coverage. Here, we apply deep learning to comprehensively model the mutational effect of the Alzheimer's Disease associated peptide Aβ42 on aggregation-related biochemical traits from DMS measurements. Among tested neural network architectures, Convolutional Neural Networks and Recurrent Neural Networks are found to be the most cost-effective models with high performance even under insufficiently-sampled DMS studies. While sequence features are essential for satisfactory prediction from neural networks, geometric-structural features further enhance the prediction performance. Notably, we demonstrate how mechanistic insights into phenotype may be extracted from the neural networks themselves suitably designed. This methodological benefit is particularly relevant for biochemical systems displaying a strong coupling between structure and phenotype such as the conformation of Aβ42 aggregate and nucleation, as shown here using a Graph Convolutional Neural Network (GCN) developed from the protein atomic structure input. In addition to accurate imputation of missing values (which here ranged up to 55% of all phenotype values at key residues), the mutationally-defined nucleation phenotype generated from a GCN shows improved resolution for identifying known disease-causing mutations relative to the original DMS phenotype. Our study suggests that neural network derived sequence-phenotype mapping can be exploited not only to provide direct support for protein engineering or genome editing but also to facilitate therapeutic design with the gained perspectives from biological modeling.

Alzheimer's disease↗
PubMed2006

Extracting gene networks for low-dose radiation using graph theoretical algorithms.

Genes with common functions often exhibit correlated expression levels, which can be used to identify sets of interacting genes from microarray data. Microarrays typically measure expression across genomic space, creating a massive matrix of co-expression that must be mined to extract only the most relevant gene interactions. We describe a graph theoretical approach to extracting co-expressed sets of genes, based on the computation of cliques. Unlike the results of traditional clustering algorithms, cliques are not disjoint and allow genes to be assigned to multiple sets of interacting partners, consistent with biological reality. A graph is created by thresholding the correlation matrix to include only the correlations most likely to signify functional relationships. Cliques computed from the graph correspond to sets of genes for which significant edges are present between all members of the set, representing potential members of common or interacting pathways. Clique membership can be used to infer function about poorly annotated genes, based on the known functions of better-annotated genes with which they share clique membership (i.e., "guilt-by-association"). We illustrate our method by applying it to microarray data collected from the spleens of mice exposed to low-dose ionizing radiation. Differential analysis is used to identify sets of genes whose interactions are impacted by radiation exposure. The correlation graph is also queried independently of clique to extract edges that are impacted by radiation. We present several examples of multiple gene interactions that are altered by radiation exposure and thus represent potential molecular pathways that mediate the radiation response.

Algorithms↗
PubMed2004

CARRIE web service: automated transcriptional regulatory network inference and interactive analysis.

We present an intuitive and interactive web service for CARRIE (Computational Ascertainment of Regulatory Relationships Inferred from Expression). CARRIE is a computational method that analyzes microarray and promoter sequence data to infer a transcriptional regulatory network from the response to a specific stimulus. This service displays an interactive graph of the inferred network and provides easy access to the evidence for the involvement of each gene in the network. We provide functionality to include network data in KEGG XML (KGML) format in this graph. Our service also provides Gene Ontology annotation to aid the user in forming hypotheses about the role of each gene in the cellular response. The CARRIE web service is freely available at http://zlab.bu.edu/CARRIE-web.

Binding Sites↗
PubMed2004

Epigenesis and dynamic similarity in two regulatory networks in Pseudomonas aeruginosa.

Mucoidy and cytotoxicity arise from two independent modifications of the phenotype of the bacterium Pseudomonas aeruginosa that contribute to the mortality and morbidity of cystic fibrosis. We show that, even though the transcriptional regulatory networks controlling both processes are quite different from a molecular or mechanistic point of view, they may be identical from a dynamic point of view: epigenesis may in both cases be the cause of the acquisition of these new phenotypes. This was highlighted by the identity of formal graphs modelling these networks. A mathematical framework based on formal methods from computer science was defined and implemented with a software environment. It allows an easy and rigorous validation and certification of these models and of the experimental methods that can be proposed to falsify or validate the underlying hypothesis.

Epigenesis, Genetic↗
PubMed2006

Unique reconstruction of tree-like phylogenetic networks from distances between leaves.

In this paper, a class of rooted acyclic directed graphs (called TOM-networks) is defined that generalizes rooted trees and allows for models including hybridization events. It is argued that the defining properties are biologically plausible. Each TOM-network has a distance defined between each pair of vertices. For a TOM-network N, suppose that the set X consisting of the leaves and the root is known, together with the distances between members of X. It is proved that N is uniquely determined from this information and can be reconstructed in polynomial time. Thus, given exact distance information on the leaves and root, the phylogenetic network can be uniquely recovered, provided that it is a TOM-network. An outgroup can be used instead of a true root.

Genetic Techniques↗
PubMed2003

Genetic regulation networks: circuits, regulons and attractors.

We deal in this paper with the concept of genetic regulation network. The genes expression observed through the bio-array imaging allows the geneticist to obtain the intergenic interaction matrix W of the network. The interaction graph G associated to W presents in general interesting features like connected components, gardens of Eden, positive and negative circuits (or loops), and minimal components having 1 positive and 1 negative loop called regulons. Depending on parameters values like the connectivity coefficient K(W) and the mean inhibition weight I(W), the genetic regulation network can present several dynamical behaviours (fixed configuration, limit cycle of configurations) called attractors, when the observation time increases. We give some examples of such genetic regulation networks and analyse their dynamical properties and their biological consequences.

Animals↗
PubMed1979

Structure and dynamics of neural network oscillators.

Techniques are given to represent oscillating neural networks by asynchronous logical switching networks, and to analyze the oscillating networks using a directed graph called a state transition diagram. Consideration is restricted to network oscillators containing no rhythm determining pacemaker neurons, and no neurons exhibiting self-limiting properties such as post-inhibitory rebound or accumulating refractoriness. In the state transition diagrams, stable oscillations are associated with a particular geometric configuration called a cyclic attractor (the heavy cycle in Fig. 2). We show that given the network connectivity it is possible to predict autonomous dynamic behaviour, as well as behaviour following hyperpolarizing or depolarizing inputs to neurons of the network. Conversely, given information about patterns of firing activity during cycles and transients of neural networks, the network connectivity can be predicted. The theoretical techniques can be used to generate a census of network structures capable of generating stable oscillations. Several representative network oscillators are discussed in the context of previous theoretical and experimental studies of the structure of neural network oscillators. Although the number of theoretically possile network oscillators capable of generating sustained oscillations is very large, the techniques which are given should be useful in the design of experiments capable of distinguishing between equally plausible hypotheses.

Action Potentials↗
PubMed2000

Graph-set and packing analysis of hydrogen-bonded networks in polyamide structures in the Cambridge Structural Database.

The hydrogen-bond networks and crystal packing of 81 unique secondary di- and polyamides in the Cambridge Structural Database are investigated. Graph-set analysis, as implemented in the RPluto program, is used to classify network motifs. These have been rationalized in terms of the relative dispositions of the amide groups. Peptide and retropeptides exhibit significant conformational flexibility, which permits alternative hydrogen-bonding patterns. In peptides, dihedral angles of -psi approximately varphi approximately 105 degrees allow an antiparallel ladder arrangement, containing rings of either the same or alternating sizes. For retropeptides, and diamides with an odd number of CH(2) spacers, this conformation leads to a parallel ladder with rings of equal size. If varphi approaches -60 degrees and psi 180 degrees, ladders adopt a helical twist, and if the conformation is distorted further, a three-dimensional network is usually adopted. Diamides with aromatic or an even number of CH(2) spacers generally form either antiparallel ladders or sheets, although some exhibit both polymorphs. Symmetry relationships within and between hydrogen-bonded chains, ladders and sheets in the crystal packing have also been analysed. Polyamides form considerably more complex networks, although many of the structural motifs present in the diamides occur as components of these networks.

Journal Article↗
PubMed2003

Duplication models for biological networks.

Are biological networks different from other large complex networks? Both large biological and nonbiological networks exhibit power-law graphs (number of nodes with degree k, N(k) approximately k(-beta)), yet the exponents, beta, fall into different ranges. This may be because duplication of the information in the genome is a dominant evolutionary force in shaping biological networks (like gene regulatory networks and protein-protein interaction networks) and is fundamentally different from the mechanisms thought to dominate the growth of most nonbiological networks (such as the Internet). The preferential choice models used for nonbiological networks like web graphs can only produce power-law graphs with exponents greater than 2. We use combinatorial probabilistic methods to examine the evolution of graphs by node duplication processes and derive exact analytical relationships between the exponent of the power law and the parameters of the model. Both full duplication of nodes (with all their connections) as well as partial duplication (with only some connections) are analyzed. We demonstrate that partial duplication can produce power-law graphs with exponents less than 2, consistent with current data on biological networks. The power-law exponent for large graphs depends only on the growth process, not on the starting graph.

Internet↗
PubMed2006

Extraction and analysis of traffic and topologies of transportation networks.

The knowledge of real-life traffic patterns is crucial for a good understanding and analysis of transportation systems. These data are quite rare. In this paper we propose an algorithm for extracting both the real physical topology and the network of traffic flows from timetables of public mass transportation systems. We apply this algorithm to timetables of three large transportation networks. This enables us to make a systematic comparison between three different approaches to construct a graph representation of a transportation network; the resulting graphs are fundamentally different. We also find that the real-life traffic pattern is very heterogenous, in both space and traffic flow intensities, which makes it very difficult to approximate the node load with a number of topological estimators.

Journal Article↗
PubMed1994

A computational model of information retrieval with UMLS.

A high level representation of data would clarify the complex collection of medical concepts, terms and relationships derived from standard classifications that the Unified Medical Language System contains. A conceptual model is described which represents the data structure. A second objective of this conceptual model is to provide users with the capability to build queries to information databases as easily as possible on the basis of this data structure. The methods used to build this model are semantic networks and conceptual graphs. The object-oriented computational model which implements this conceptual model is detailed. It reuses part of the generic C++ classes of the National Institutes of Health library. New classes are added to this library to implement the needed functionalities.

Information Storage and Retrieval↗
PubMed1997

Generic properties of combinatory maps: neutral networks of RNA secondary structures.

Random graph theory is used to model and analyse the relationships between sequences and secondary structures of RNA molecules, which are understood as mappings from sequence space into shape space. These maps are non-invertible since there are always many orders of magnitude more sequences than structures. Sequences folding into identical structures form neutral networks. A neutral network is embedded in the set of sequences that are compatible with the given structure. Networks are modeled as graphs and constructed by random choice of vertices from the space of compatible sequences. The theory characterizes neutral networks by the mean fraction of neutral neighbors (lambda). The networks are connected and percolate sequence space if the fraction of neutral nearest neighbors exceeds a threshold value (lambda > lambda *). Below threshold (lambda < lambda *), the networks are partitioned into a largest "giant" component and several smaller components. Structures are classified as "common" or "rare" according to the sizes of their pre-images, i.e. according to the fractions of sequences folding into them. The neutral networks of any pair of two different common structures almost touch each other, and, as expressed by the conjecture of shape space covering sequences folding into almost all common structures, can be found in a small ball of an arbitrary location in sequence space. The results from random graph theory are compared to data obtained by folding large samples of RNA sequences. Differences are explained in terms of specific features of RNA molecular structures.

Base Sequence↗