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

Observing local and global properties of metabolic pathways: 'load points' and 'choke points' in the metabolic networks.

MOTIVATION: The local and global aspects of metabolic network analyses allow us to identify enzymes or reactions that are crucial for the survival of the organism(s), therefore directing us towards the discovery of potential drug targets. RESULTS: We demonstrate a new method ('load points') to rank the enzymes/metabolites in the metabolic network and propose a model to determine and rank the biochemical lethality in metabolic networks (enzymes/metabolites) through 'choke points'. Based on an extended form of the graph theory model of metabolic networks, metabolite structural information was used to calculate the k-shortest paths between metabolites (the presence of more than one competing path between substrate and product). On the basis of these paths and connectivity information, load points were calculated and used to empirically rank the importance of metabolites/enzymes in the metabolic network. The load point analysis emphasizes the role that the biochemical structure of a metabolite, rather than its connectivity (hubs), plays in the conversion pathway. In order to identify potential drug targets (based on the biochemical lethality of metabolic networks), the concept of choke points and load points was used to find enzymes (edges) which uniquely consume or produce a particular metabolite (nodes). A non-pathogenic bacterial strain Bacillus subtilis 168 (lactic acid producing bacteria) and a related pathogenic bacterial strain Bacillus anthracis Sterne (avirulent but toxigenic strain, producing the toxin Anthrax) were selected as model organisms. The choke point strategy was implemented on the pathogen bacterial network of B.anthracis Sterne. Potential drug targets are proposed based on the analysis of the top 10 choke points in the bacterial network. A comparative study between the reported top 10 bacterial choke points and the human metabolic network was performed. Further biological inferences were made on results obtained by performing a homology search against the human genome. AVAILABILITY: The load and choke point modules are introduced in the Pathway Hunter Tool (PHT), the basic version of which is available on http://www.pht.uni-koeln.de.

Bacillus↗
PubMed2001

Methods and measures for the description of epidemiologic contact networks.

This article describes new methods to characterize epidemiologic contact networks that involve links that are being dynamically formed and dissolved. The new social network measures are designed with an epidemiologic interpretation in mind. These methods are intended to capture dynamic aspects of networks related to their potential to spread infection. This differs from many social network measures that are based on static networks. The networks are formulated as transmission graphs (TGs), in which nodes represent relationships between two individuals and directed edges (links) represent the potential of an individual in one relationship to carry infection to an individual in another relationship. Network measures derived from transmission graphs include "source counts," which are defined as the number of prior relationships that could potentially transmit infection to a particular node or individual.

Contact Tracing↗
PubMed1999

A System to Find Genetic Networks Using Weighted Network Model.

We are developing a system which finds a genetic network from data obtained by multiple gene disruptions and overexpressions. We deal with a genetic network as a weighted graph, where each weight represents the strength of activation from a gene to another gene. In this paper, we explain the overview of our system, and our strategy to visualize the weighted network. We also study the computational complexity related to the visualization.

Journal Article↗
PubMed2026

PaNDA: Efficient Optimization of Phylogenetic Diversity in Networks.

Phylogenetic diversity (PD) plays an important role in biodiversity, conservation, and evolutionary studies by measuring the diversity of a set of taxa based on their phylogenetic relationships. In phylogenetic trees, a subset of k taxa with maximum PD can be found by a simple and efficient greedy algorithm. However, this algorithmic tractability is lost when considering phylogenetic networks, which incorporate reticulate evolutionary events such as hybridization and horizontal gene transfer. To address this challenge, we introduce PaNDA (Phylogenetic Network Diversity Algorithms), the first software package and interactive graphical user-interface for exploring, visualizing, and maximizing diversity in phylogenetic networks. PaNDA includes a novel algorithm to find a subset of k taxa with maximum diversity, running in polynomial time for networks of bounded scanwidth, a measure of tree-likeness of a network that grows slower than the well-known level measure. This algorithm considers the variant of PD on networks in which the branch lengths of all paths from the root to the selected taxa contribute towards their diversity. We demonstrate the scalability of this algorithm on simulated networks, successfully analyzing level-15 networks with up to 200 taxa in seconds. We also provide a proof-of-concept analysis using a phylogenetic network on Xiphophorus species, illustrating how the tool can support diversity studies based on real genomic data. The software is easily installable and freely available at https://github.com/nholtgrefe/panda. Additionally, we extend the definition of PD to semi-directed phylogenetic networks, which are mixed graphs increasingly used in phylogenetic analysis to model uncertainty of the root location. We prove that finding a subset of k taxa with maximum diversity remains NP-hard on semi-directed networks, but do present a polynomial-time algorithm for networks with bounded level.

network↗
PubMed2005

Geometric diffusions for the analysis of data from sensor networks.

Harmonic analysis on manifolds and graphs has recently led to mathematical developments in the field of data analysis. The resulting new tools can be used to compress and analyze large and complex data sets, such as those derived from sensor networks or neuronal activity datasets, obtained in the laboratory or through computer modeling. The nature of the algorithms (based on diffusion maps and connectivity strengths on graphs) possesses a certain analogy with neural information processing, and has the potential to provide inspiration for modeling and understanding biological organization in perception and memory formation.

Algorithms↗
PubMed2005

Linking experimental results, biological networks and sequence analysis methods using Ontologies and Generalised Data Structures.

The structure of a closely integrated data warehouse is described that is designed to link different types and varying numbers of biological networks, sequence analysis methods and experimental results such as those coming from microarrays. The data schema is inspired by a combination of graph based methods and generalised data structures and makes use of ontologies and meta-data. The core idea is to consider and store biological networks as graphs, and to use generalised data structures (GDS) for the storage of further relevant information. This is possible because many biological networks can be stored as graphs: protein interactions, signal transduction networks, metabolic pathways, gene regulatory networks etc. Nodes in biological graphs represent entities such as promoters, proteins, genes and transcripts whereas the edges of such graphs specify how the nodes are related. The semantics of the nodes and edges are defined using ontologies of node and relation types. Besides generic attributes that most biological entities possess (name, attribute description), further information is stored using generalised data structures. By directly linking to underlying sequences (exons, introns, promoters, amino acid sequences) in a systematic way, close interoperability to sequence analysis methods can be achieved. This approach allows us to store, query and update a wide variety of biological information in a way that is semantically compact without requiring changes at the database schema level when new kinds of biological information is added. We describe how this datawarehouse is being implemented by extending the text-mining framework ONDEX to link, support and complement different bioinformatics applications and research activities such as microarray analysis, sequence analysis and modelling/simulation of biological systems. The system is developed under the GPL license and can be downloaded from http://sourceforge.net/projects/ondex/

Algorithms↗
PubMed2004

Solution of the two-star model of a network.

The p-star model or exponential random graph is among the oldest and best known of network models. Here we give an analytic solution for the particular case of the two-star model, which is one of the most fundamental of exponential random graphs. We derive expressions for a number of quantities of interest in the model and show that the degenerate region of the parameter space observed in computer simulations is a spontaneously symmetry-broken phase separated from the normal phase of the model by a conventional continuous phase transition.

Journal Article↗
PubMed2002

Relation between structure and size in social networks.

In the context of complex network systems, we model social networks with the property that there is certain degradation of the information flowing through the network. We analyze different kinds of networks, from regular lattices to random graphs. We define an average coordination degree for the network, which can be associated with a certain notion of efficiency. Assuming that there is a limit to the information a person may handle, we show that there exists a close relationship between the structure of the network and its maximum size.

Journal Article↗
PubMed2006

Discovering functional gene expression patterns in the metabolic network of Escherichia coli with wavelets transforms.

BACKGROUND: Microarray technology produces gene expression data on a genomic scale for an endless variety of organisms and conditions. However, this vast amount of information needs to be extracted in a reasonable way and funneled into manageable and functionally meaningful patterns. Genes may be reasonably combined using knowledge about their interaction behaviour. On a proteomic level, biochemical research has elucidated an increasingly complete image of the metabolic architecture, especially for less complex organisms like the well studied bacterium Escherichia coli. RESULTS: We sought to discover central components of the metabolic network, regulated by the expression of associated genes under changing conditions. We mapped gene expression data from E. coli under aerobic and anaerobic conditions onto the enzymatic reaction nodes of its metabolic network. An adjacency matrix of the metabolites was created from this graph. A consecutive ones clustering method was used to obtain network clusters in the matrix. The wavelet method was applied on the adjacency matrices of these clusters to collect features for the classifier. With a feature extraction method the most discriminating features were selected. We yielded network sub-graphs from these top ranking features representing formate fermentation, in good agreement with the anaerobic response of hetero-fermentative bacteria. Furthermore, we found a switch in the starting point for NAD biosynthesis, and an adaptation of the l-aspartate metabolism, in accordance with its higher abundance under anaerobic conditions. CONCLUSION: We developed and tested a novel method, based on a combination of rationally chosen machine learning methods, to analyse gene expression data on the basis of interaction data, using a metabolic network of enzymes. As a case study, we applied our method to E. coli under oxygen deprived conditions and extracted physiologically relevant patterns that represent an adaptation of the cells to changing environmental conditions. In general, our concept may be transferred to network analyses on biological interaction data, when data for two comparable states of the associated nodes are made available.

Algorithms↗
PubMed2004

GeneInfoViz: constructing and visualizing gene relation networks.

Large amounts of knowledge about genes have been stored in public databases. One of the most challenging problems in Bioinformatics is, given all the information about the genes in the databases, determining the relationships between the genes. For example, how can we determine if genes are related and how closely they are related based on existing knowledge about their biological roles. We developed GeneInfoViz, a web tool for batch retrieval of gene information and construction and visualization of gene relation networks. We created a database containing compiled Gene Ontology information for the genes of several model organisms. Users can batch search for a group of genes and get the Gene Ontology terms that are associated with the genes. Directed acyclic graphs are generated to show the hierarchical structure of the Gene Ontology tree. GeneInfoViz calculates an adjacency matrix to determine whether the genes are related and, if so, how closely they are related based on biological processes, molecular functions, or cellular components they are associated with and then displays a dynamic graph layout of the network among the selected genes.

Databases, Genetic↗
PubMed2005

Undirected graphs of frequency-dependent functional connectivity in whole brain networks.

We explored properties of whole brain networks based on multivariate spectral analysis of human functional magnetic resonance imaging (fMRI) time-series measured in 90 cortical and subcortical subregions in each of five healthy volunteers studied in the (no-task) resting state. We note that undirected graphs representing conditional independence between multivariate time-series can be more readily approached in the frequency domain than the time domain. Estimators of partial coherency and normalized partial mutual information phi, an integrated measure of partial coherence over an arbitrary frequency band, are applied. Using these tools, we replicate the prior observations that bilaterally homologous brain regions tend to be strongly connected and functional connectivity is generally greater at low frequencies [0.0004, 0.1518 Hz]. We also show that long-distance intrahemispheric connections between regions of prefrontal and parietal cortex were more salient at low frequencies than at frequencies greater than 0.3 Hz, whereas many local or short-distance connections, such as those comprising segregated dorsal and ventral paths in posterior cortex, were also represented in the graph of high-frequency connectivity. We conclude that the partial coherency spectrum between a pair of human brain regional fMRI time-series depends on the anatomical distance between regions: long-distance (greater than 7 cm) edges represent conditional dependence between bilaterally symmetric neocortical regions, and between regions of prefrontal and parietal association cortex in the same hemisphere, are predominantly subtended by low-frequency components.

Brain↗
PubMed2005

Algorithms for protein interaction networks.

The functional characterization of all genes and their gene products is the main challenge of the postgenomic era. Recent experimental and computational techniques have enabled the study of interactions among all proteins on a large scale. In this paper, approaches will be presented to exploit interaction information for the inference of protein structure, function, signalling pathways and ultimately entire interactomes. Interaction networks can be modelled as graphs, showing the operation of gene function in terms of protein interactions. Since the architecture of biological networks differs distinctly from random networks, these functional maps contain a signal that can be used for predictive purposes. Protein function and structure can be predicted by matching interaction patterns, without the requirement of sequence similarity. Moving on to a higher level definition of protein function, the question arises how to decompose complex networks into meaningful subsets. An algorithm will be demonstrated, which extracts whole signal-transduction pathways from noisy graphs derived from text-mining the biological literature. Finally, an algorithmic strategy is formulated that enables the proteomics community to build a reliable scaffold of the interactome in a fraction of the time compared with uncoordinated efforts.

Algorithms↗
PubMed2006

Pairwise alignment of protein interaction networks.

With an ever-increasing amount of available data on protein-protein interaction (PPI) networks and research revealing that these networks evolve at a modular level, discovery of conserved patterns in these networks becomes an important problem. Although available data on protein-protein interactions is currently limited, recently developed algorithms have been shown to convey novel biological insights through employment of elegant mathematical models. The main challenge in aligning PPI networks is to define a graph theoretical measure of similarity between graph structures that captures underlying biological phenomena accurately. In this respect, modeling of conservation and divergence of interactions, as well as the interpretation of resulting alignments, are important design parameters. In this paper, we develop a framework for comprehensive alignment of PPI networks, which is inspired by duplication/divergence models that focus on understanding the evolution of protein interactions. We propose a mathematical model that extends the concepts of match, mismatch, and gap in sequence alignment to that of match, mismatch, and duplication in network alignment and evaluates similarity between graph structures through a scoring function that accounts for evolutionary events. By relying on evolutionary models, the proposed framework facilitates interpretation of resulting alignments in terms of not only conservation but also divergence of modularity in PPI networks. Furthermore, as in the case of sequence alignment, our model allows flexibility in adjusting parameters to quantify underlying evolutionary relationships. Based on the proposed model, we formulate PPI network alignment as an optimization problem and present fast algorithms to solve this problem. Detailed experimental results from an implementation of the proposed framework show that our algorithm is able to discover conserved interaction patterns very effectively, in terms of both accuracies and computational cost.

Algorithms↗
PubMed2005

Functional essentiality from topology features in metabolic networks: a case study in yeast.

The relation between the position of mutations in Saccharomyces cerevisiae metabolic network and their lethality is the subject of this work. We represent the topology of the network by a directed graph: nodes are metabolites and arcs represent the reactions; a mutation corresponds to the removal of all the arcs referring to the deleted enzyme. Using publicly available knock-out data, we show that lethality corresponds to the lack of alternative paths in the perturbed network linking the nodes affected by the enzyme deletion. Such feature is at the basis of the recently recognized importance of 'marginal' arcs of metabolic networks.

Energy Metabolism↗
PubMed2005

The loading problem for recursive neural networks.

The present work deals with one of the major and not yet completely understood topics of supervised connectionist models. Namely, it investigates the relationships between the difficulty of a given learning task and the chosen neural network architecture. These relationships have been investigated and nicely established for some interesting problems in the case of neural networks used for processing vectors and sequences, but only a few studies have dealt with loading problems involving graphical inputs. In this paper, we present sufficient conditions which guarantee the absence of local minima of the error function in the case of learning directed acyclic graphs with recursive neural networks. We introduce topological indices which can be directly calculated from the given training set and that allows us to design the neural architecture with local minima free error function. In particular, we conceive a reduction algorithm that involves both the information attached to the nodes and the topology, which enlarges significantly the class of the problems with unimodal error function previously proposed in the literature.

Algorithms↗
PubMed2000

Using Bayesian networks to analyze expression data.

DNA hybridization arrays simultaneously measure the expression level for thousands of genes. These measurements provide a "snapshot" of transcription levels within the cell. A major challenge in computational biology is to uncover, from such measurements, gene/protein interactions and key biological features of cellular systems. In this paper, we propose a new framework for discovering interactions between genes based on multiple expression measurements. This framework builds on the use of Bayesian networks for representing statistical dependencies. A Bayesian network is a graph-based model of joint multivariate probability distributions that captures properties of conditional independence between variables. Such models are attractive for their ability to describe complex stochastic processes and because they provide a clear methodology for learning from (noisy) observations. We start by showing how Bayesian networks can describe interactions between genes. We then describe a method for recovering gene interactions from microarray data using tools for learning Bayesian networks. Finally, we demonstrate this method on the S. cerevisiae cell-cycle measurements of Spellman et al. (1998).

Algorithms↗
PubMed2006

A resilient, low-frequency, small-world human brain functional network with highly connected association cortical hubs.

Small-world properties have been demonstrated for many complex networks. Here, we applied the discrete wavelet transform to functional magnetic resonance imaging (fMRI) time series, acquired from healthy volunteers in the resting state, to estimate frequency-dependent correlation matrices characterizing functional connectivity between 90 cortical and subcortical regions. After thresholding the wavelet correlation matrices to create undirected graphs of brain functional networks, we found a small-world topology of sparse connections most salient in the low-frequency interval 0.03-0.06 Hz. Global mean path length (2.49) was approximately equivalent to a comparable random network, whereas clustering (0.53) was two times greater; similar parameters have been reported for the network of anatomical connections in the macaque cortex. The human functional network was dominated by a neocortical core of highly connected hubs and had an exponentially truncated power law degree distribution. Hubs included recently evolved regions of the heteromodal association cortex, with long-distance connections to other regions, and more cliquishly connected regions of the unimodal association and primary cortices; paralimbic and limbic regions were topologically more peripheral. The network was more resilient to targeted attack on its hubs than a comparable scale-free network, but about equally resilient to random error. We conclude that correlated, low-frequency oscillations in human fMRI data have a small-world architecture that probably reflects underlying anatomical connectivity of the cortex. Because the major hubs of this network are critical for cognition, its slow dynamics could provide a physiological substrate for segregated and distributed information processing.

Adult↗
PubMed2006

Topology and static response of interaction networks in molecular biology.

We introduce a mathematical framework describing static response of networks occurring in molecular biology. This formalism has many similarities with the Laplace-Kirchhoff equations for electrical networks. We introduce the concept of graph boundary and we show how the response of the biological networks to external perturbations can be related to the Dirichlet or Neumann problems for the corresponding equations on the interaction graph. Solutions to these two problems are given in terms of path moduli (measuring path rigidity with respect to the propagation of interaction along the graph). Path moduli are related to loop products in the interaction graph via generalized Mason-Coates formulae. We apply our results to two specific biological examples: the lactose operon and the genetic regulation of lipogenesis. Our applications show consistency with experimental results and in the case of lipogenesis check some hypothesis on the behaviour of hepatic fatty acids on fasting.

Animals↗