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

Synchronization reveals topological scales in complex networks.

We study the relationship between topological scales and dynamic time scales in complex networks. The analysis is based on the full dynamics towards synchronization of a system of coupled oscillators. In the synchronization process, modular structures corresponding to well-defined communities of nodes emerge in different time scales, ordered in a hierarchical way. The analysis also provides a useful connection between synchronization dynamics, complex networks topology, and spectral graph analysis.

Journal Article↗
PubMedDate not supplied

Phylogenetic networks: modeling, reconstructibility, and accuracy.

Phylogenetic networks model the evolutionary history of sets of organisms when events such as hybrid speciation and horizontal gene transfer occur. In spite of their widely acknowledged importance in evolutionary biology, phylogenetic networks have so far been studied mostly for specific data sets. We present a general definition of phylogenetic networks in terms of directed acyclic graphs (DAGs) and a set of conditions. Further, we distinguish between model networks and reconstructible ones and characterize the effect of extinction and taxon sampling on the reconstructibility of the network. Simulation studies are a standard technique for assessing the performance of phylogenetic methods. A main step in such studies entails quantifying the topological error between the model and inferred phylogenies. While many measures of tree topological accuracy have been proposed, none exist for phylogenetic networks. Previously, we proposed the first such measure, which applied only to a restricted class of networks. In this paper, we extend that measure to apply to all networks, and prove that it is a metric on the space of phylogenetic networks. Our results allow for the systematic study of existing network methods, and for the design of new accurate ones.

Algorithms↗
PubMed2005

Toward predictive models of mammalian cells.

Progress in experimental and theoretical biology is likely to provide us with the opportunity to assemble detailed predictive models of mammalian cells. Using a functional format to describe the organization of mammalian cells, we describe current approaches for developing qualitative and quantitative models using data from a variety of experimental sources. Recent developments and applications of graph theory to biological networks are reviewed. The use of these qualitative models to identify the topology of regulatory motifs and functional modules is discussed. Cellular homeostasis and plasticity are interpreted within the framework of balance between regulatory motifs and interactions between modules. From this analysis we identify the need for detailed quantitative models on the basis of the representation of the chemistry underlying the cellular process. The use of deterministic, stochastic, and hybrid models to represent cellular processes is reviewed, and an initial integrated approach for the development of large-scale predictive models of a mammalian cell is presented.

Amino Acid Motifs↗
PubMed2004

An implementation of automated individual matching for observational studies.

OBJECTIVES: Individual matching is frequently used in observational studies. Its main purpose lies in efficiency of study conduct and parameter estimation. Ideally, an individually matched index subject differs from the reference subject(s) only by the factor(s) of interest. Matching is used to select comparable subgroups on which further data analysis can then concentrate. Finding optimal subsets is then a closed problem, which may include a lot of guesswork. It is a task that begs an algorithmic solution that can be obtained automatically. METHODS: The problem can be formalized as a minimization of a global loss function that summarizes the deviation from perfect agreement over different variables. Through the representation by a network formed by a bipartite graph of index and reference subjects, one can obtain a solution by finding a minimum cost flow in a certain network. We have implemented a Web-based application using the efficient CS2 algorithm. RESULTS: Variations of the individual matching procedures that have been implemented comprise 1:N matching and matching with a variable number of controls. The user can upload own data, view the proposed result in a list and finally download the matching plan. Representation of quality of individual matches as background colors allows rapid checks for overall matching accuracy. CONCLUSIONS: The computer-assisted variation reduces the human interaction to the tuning of a few parameters, rather than individual decisions on forming separate matches. This not only saves a lot of work but also simplifies communicating the matching process. The program addresses a general class of matching problems. The use of this tool for special cases of matching, as caliper matching or exact category matching, is highlighted.

Algorithms↗
PubMed2004

Nest excavation in ants: group size effects on the size and structure of tunneling networks.

Collective digging activity was studied in the ant Messor sancta Forel in laboratory conditions and with a two dimensional set-up. We analyzed the digging dynamics and topology of tunneling networks excavated by groups of workers ranging from 50 to 200 individuals over 3 days. In all conditions, the dynamics of excavated sand volume were clearly non-linear. Excavation began with an exponential growth and after 3 days reached a saturation phase in which activity was almost totally stopped. The final volume of sand excavated was positively correlated with the number of workers. At the end of the experiments, the two-dimensional tunneling networks were mapped onto planar graphs where the vertices represent small chambers or intersections between tunnels and the edges represent tunnels. We found that all the networks belonged to a same topological family and exhibited several striking invariants such as the distribution of vertex degree that follows a power law. When increasing the number of ants, some changes occurred in the network structure, mainly an increase in the number of edges and vertices, and the progressive emergence of enlarged and highly connected vertices.

Animals↗
PubMed2003

Prediction of protein coarse contact maps.

Prediction of topological representations of proteins that are geometrically invariants can contribute towards the solution of fundamental open problems in structural genomics like folding. In this paper we focus on coarse grained protein contact maps, a representation that describes the spatial neighborhood relation between secondary structure elements such as helices, beta sheets, and random coils. Our methodology is based on searching the graph space. The search algorithm is guided by an adaptive evaluation function computed by a specialized noncausal recursive connectionist architecture. The neural network is trained using candidate graphs generated during examples of successful searches. Our results demonstrate the viability of the approach for predicting coarse contact maps.

Algorithms↗
PubMed2004

Positive and negative circuits in discrete neural networks.

We study the relationships between the positive and negative circuits of the connection graph and the fixed points of discrete neural networks (DNNs). As main results, we give necessary conditions and sufficient conditions for the existence of fixed points in a DNN. Moreover, we exhibit an upper bound for the number of fixed points in terms of the structure and number of positive circuits in the connection graph. This allows the determination of the maximum capacity for storing vectors in DNNs as fixed points, depending on the architecture of the network.

Neural Networks, Computer↗
PubMed2001

The small world inside large metabolic networks.

The metabolic network of the catabolic, energy and biosynthetic metabolism of Escherichia coli is a paradigmatic case for the large genetic and metabolic networks that functional genomics efforts are beginning to elucidate. To analyse the structure of previously unknown networks involving hundreds or thousands of components by simple visual inspection is impossible, and quantitative approaches are needed to analyse them. We have undertaken a graph theoretical analysis of the E. coli metabolic network and find that this network is a small-world graph, a type of graph distinct from both regular and random networks and observed in a variety of seemingly unrelated areas, such as friendship networks in sociology, the structure of electrical power grids, and the nervous system of Caenorhabditis elegans. Moreover, the connectivity of the metabolites follows a power law, another unusual but by no means rare statistical distribution. This provides an objective criterion for the centrality of the tricarboxylic acid cycle to metabolism. The small-world architecture may serve to minimize transition times between metabolic states, and contains evidence about the evolutionary history of metabolism.

Escherichia coli↗
PubMed1993

A graph theory model of the semantic structure of attitudes.

The semantic structure underlying the attitudes of pretreatment and posttreatment drug addicts was modeled using a network analysis of free word associations. Measures of graph theoretic properties were used to assess structural differences in the associative networks of the two populations. These measures modeled the information processes of associative networks proposed in the spreading activation theory of semantic processing. As expected based on graph theory, the structure of the associative networks of posttreatment subjects was more dense, less constrained, and more hierarchically organized by the self concept. In a test of the network model, the subjects' evaluations of concepts in the associative network were found to be a function of their evaluations of semantically similar concepts. Although preliminary and limited, the results suggest that graph theory may provide a broad mathematical foundation for diverse models of cognitive systems.

Attitude↗
PubMed1993

A tutorial introduction to stochastic simulation algorithms for belief networks.

Belief networks combine probabilistic knowledge with explicit information about conditional independence assumptions. A belief network consists of a directed acyclic graph in which the nodes represent variables and the edges express relationships of conditional dependence. When information about one variable's state is given to the network in the form of evidence, an update algorithm computes the posterior marginal probability distributions for the remaining variables in the network. Many algorithms for performing this inference task have been proposed. Exact algorithms report precise results for some classes of networks, but take exponential time (in the number of nodes) both in the worst case and for many interesting networks. Stochastic simulation algorithms estimate the posterior marginal probability distribution for many graph topologies that would require exponential time when using an exact algorithm. Nonetheless, for some belief networks, stochastic simulation algorithms are also known to have exponential worst case performance. This article describes at a tutorial level several stochastic simulation algorithms for belief networks, and illustrates them on some simple examples. In addition, the theoretical and empirical performance of the algorithms is briefly surveyed.

Algorithms↗
PubMed2002

Morphological characterization of in vitro neuronal networks.

We use in vitro neuronal networks as a model system for studying self-organization processes in the nervous system. We follow the neuronal growth process, from isolated neurons to fully connected two-dimensional networks. The mature networks are mapped into connected graphs and their morphological characteristics are measured. The distributions of segment lengths, node connectivity, and path length between nodes, and the clustering coefficient of the networks are used to characterize network morphology and to demonstrate that our networks fall into the category of small-world networks.

Animals↗
PubMed2004

Discriminative topological features reveal biological network mechanisms.

BACKGROUND: Recent genomic and bioinformatic advances have motivated the development of numerous network models intending to describe graphs of biological, technological, and sociological origin. In most cases the success of a model has been evaluated by how well it reproduces a few key features of the real-world data, such as degree distributions, mean geodesic lengths, and clustering coefficients. Often pairs of models can reproduce these features with indistinguishable fidelity despite being generated by vastly different mechanisms. In such cases, these few target features are insufficient to distinguish which of the different models best describes real world networks of interest; moreover, it is not clear a priori that any of the presently-existing algorithms for network generation offers a predictive description of the networks inspiring them. RESULTS: We present a method to assess systematically which of a set of proposed network generation algorithms gives the most accurate description of a given biological network. To derive discriminative classifiers, we construct a mapping from the set of all graphs to a high-dimensional (in principle infinite-dimensional) "word space". This map defines an input space for classification schemes which allow us to state unambiguously which models are most descriptive of a given network of interest. Our training sets include networks generated from 17 models either drawn from the literature or introduced in this work. We show that different duplication-mutation schemes best describe the E. coli genetic network, the S. cerevisiae protein interaction network, and the C. elegans neuronal network, out of a set of network models including a linear preferential attachment model and a small-world model. CONCLUSIONS: Our method is a first step towards systematizing network models and assessing their predictability, and we anticipate its usefulness for a number of communities.

Animals↗
PubMed2003

Patterns in randomly evolving networks: idiotypic networks.

We present a model for the evolution of networks of occupied sites on undirected regular graphs. At every iteration step in a parallel update, I randomly chosen empty sites are occupied and occupied sites having occupied neighbor degree outside of a given interval (t(l),t(u)) are set empty. Depending on the influx I and the values of both lower threshold and upper threshold of the occupied neighbor degree, different kinds of behavior can be observed. In certain regimes stable long-living patterns appear. We distinguish two types of patterns: static patterns arising on graphs with low connectivity and dynamic patterns found on high connectivity graphs. Increasing I patterns become unstable and transitions between almost stable patterns, interrupted by disordered phases, occur. For still larger I the lifetime of occupied sites becomes very small and network structures are dominated by randomness. We develop methods to analyze the nature and dynamics of these network patterns, give a statistical description of defects and fluctuations around them, and elucidate the transitions between different patterns. Results and methods presented can be applied to a variety of problems in different fields and a broad class of graphs. Aiming chiefly at the modeling of functional networks of interacting antibodies and B cells of the immune system (idiotypic networks), we focus on a class of graphs constructed by bit chains. The biological relevance of the patterns and possible operational modes of idiotypic networks are discussed.

Journal Article↗
PubMed2006

Hypothesis generation in signaling networks.

Biological signaling networks comprise the chemical processes by which cells detect and respond to changes in their environment. Such networks have been implicated in the regulation of important cellular activities, including cellular reproduction, mobility, and death. Though technological and scientific advances have facilitated the rapid accumulation of information about signaling networks, utilizing these massive information resources has become infeasible except through computational methods and computer-based tools. To date, visualization and simulation tools have received significant emphasis. In this paper, we present a graph-theoretic formalization of biological signaling network models that are in wide but informal use, and formulate two problems on the graph: the Constrained Downstream and Minimum Knockout Problems. Solutions to these problems yield qualitative tools for generating hypotheses about the networks, which can then be experimentally tested in a laboratory setting. Using established graph algorithms, we provide a solution to the Constrained Downstream Problem. We also show that the Minimum Knockout Problem is NP-Hard, propose a heuristic, and assess its performance. In tests on the Epidermal Growth Factor Receptor (EGFR) network, we find that our heuristic reports the correct solution to the problem in seconds. Source code for the implementations of both solutions is available from the authors upon request.

Algorithms↗
PubMed1978

Bond graph models for plant biosystems.

Computable dynamic models for plant biosystems permit the study of effects of environmental variables on plant growth and productivity. Using bond graphs, a comprehensive phenomenological model of a plant biosystem may be developed and used in computer simulations. Elements of a model studied in this papaer include a gas diffusion network between the atmosphere and leaf cytoplasm, intracellular chemistry, and the translocation networks of the phloem. Bond graphs are shown to provide a conceptual basis for the development of biological subsystem and system models and lead to computable representations.

Atmosphere↗
PubMed2003

Reconstruction of metabolic networks from genome data and analysis of their global structure for various organisms.

MOTIVATION: Information from fully sequenced genomes makes it possible to reconstruct strain-specific global metabolic network for structural and functional studies. These networks are often very large and complex. To properly understand and analyze the global properties of metabolic networks, methods for rationally representing and quantitatively analyzing their structure are needed. RESULTS: In this work, the metabolic networks of 80 fully sequenced organisms are in silico reconstructed from genome data and an extensively revised bioreaction database. The networks are represented as directed graphs and analyzed by using the 'breadth first searching algorithm to identify the shortest pathway (path length) between any pair of the metabolites. The average path length of the networks are then calculated and compared for all the organisms. Different from previous studies the connections through current metabolites and cofactors are deleted to make the path length analysis physiologically more meaningful. The distribution of the connection degree of these networks is shown to follow the power law, indicating that the overall structure of all the metabolic networks has the characteristics of a small world network. However, clear differences exist in the network structure of the three domains of organisms. Eukaryotes and archaea have a longer average path length than bacteria. AVAILABILITY: The reaction database in excel format and the programs in VBA (Visual Basic for Applications) are available upon request. SUPPLEMENTARY MATERIAL: Bioinformatics Online.

Archaea↗
PubMed2006

Network growth models and genetic regulatory networks.

We study a class of growth algorithms for directed graphs that are candidate models for the evolution of genetic regulatory networks. The algorithms involve partial duplication of nodes and their links, together with the innovation of new links, allowing for the possibility that input and output links from a newly created node may have different probabilities of survival. We find some counterintuitive trends as the parameters are varied, including the broadening of the in-degree distribution when the probability for retaining input links is decreased. We also find that both the scaling of transcription factors with genome size and the measured degree distributions for genes in yeast can be reproduced by the growth algorithm if and only if a special seed is used to initiate the process.

Animals↗
PubMed2001

A combined experimental and computational strategy to define protein interaction networks for peptide recognition modules.

Peptide recognition modules mediate many protein-protein interactions critical for the assembly of macromolecular complexes. Complete genome sequences have revealed thousands of these domains, requiring improved methods for identifying their physiologically relevant binding partners. We have developed a strategy combining computational prediction of interactions from phage-display ligand consensus sequences with large-scale two-hybrid physical interaction tests. Application to yeast SH3 domains generated a phage-display network containing 394 interactions among 206 proteins and a two-hybrid network containing 233 interactions among 145 proteins. Graph theoretic analysis identified 59 highly likely interactions common to both networks. Las17 (Bee1), a member of the Wiskott-Aldrich Syndrome protein (WASP) family of actin-assembly proteins, showed multiple SH3 interactions, many of which were confirmed in vivo by coimmunoprecipitation.

Algorithms↗