• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

Specificity and stability in topology of protein networks (2002)

by S Maslov, K Sneppen
Add To MetaCart

Tools

Sorted by:
Results 1 - 10 of 408
Next 10 →

The structure and function of complex networks

by M. E. J. Newman - SIAM REVIEW , 2003
"... Inspired by empirical studies of networked systems such as the Internet, social networks, and biological networks, researchers have in recent years developed a variety of techniques and models to help us understand or predict the behavior of these systems. Here we review developments in this field, ..."
Abstract - Cited by 2600 (7 self) - Add to MetaCart
Inspired by empirical studies of networked systems such as the Internet, social networks, and biological networks, researchers have in recent years developed a variety of techniques and models to help us understand or predict the behavior of these systems. Here we review developments in this field, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.
(Show Context)

Citation Context

...ons between proteins (as opposed to chemical reactions among metabolites), which is usually referred to as a protein interaction network. Interaction networks have been studied by a number of authors =-=[206, 212, 274, 376, 394]-=-. Another important class of biological network is the genetic regulatory network. The expression of a gene, i.e., the production by transcription and translation of the protein for which the gene cod...

Complex network measures of brain connectivity: . . .

by Mikail Rubinov , Olaf Sporns , 2010
"... ..."
Abstract - Cited by 307 (4 self) - Add to MetaCart
Abstract not found

The spread of behavior in an online social network experiment,”

by Damon Centola - Science , 2010
"... How do social networks affect the spread of behavior? A popular hypothesis states that networks with many clustered ties and a high degree of separation will be less effective for behavioral diffusion than networks in which locally redundant ties are rewired to provide shortcuts across the social s ..."
Abstract - Cited by 213 (4 self) - Add to MetaCart
How do social networks affect the spread of behavior? A popular hypothesis states that networks with many clustered ties and a high degree of separation will be less effective for behavioral diffusion than networks in which locally redundant ties are rewired to provide shortcuts across the social space. A competing hypothesis argues that when behaviors require social reinforcement, a network with more clustering may be more advantageous, even if the network as a whole has a larger diameter. I investigated the effects of network structure on diffusion by studying the spread of health behavior through artificially structured online communities. Individual adoption was much more likely when participants received social reinforcement from multiple neighbors in the social network. The behavior spread farther and faster across clustered-lattice networks than across corresponding random networks.
(Show Context)

Citation Context

.... In the clustered-lattice–network condition, there was a high level of clustering (5, 6, 13) created by redundant ties that linked each node’s neighbors to one another. The random network condition was created by rewiring the clustered-lattice network via a permutation algorithm based on the small-world–network model (6, 13–15). This ensured that each node maintained the exact same number of neighbors as in the clustered network (that is, a homogeneous degree distribution), while simultaneously reducing clustering in the network and eliminating redundant ties within and between neighborhoods (4, 6, 14). View larger version (76K): [in this window] [in a new window] Fig. 1. Randomization of participants to clustered-lattice and random-network conditions in a single trial of this study (N = 128, Z = 6). In each condition, the black node shows the focal node of a neighborhood to which an individual is being assigned, and the red nodes correspond to that individual’s neighbors in the network. In the clustered-lattice network, the red nodes share neighbors with each other, whereas in the random network they do not. White nodes indicate individuals who are not connected to the focal node. The netw...

Scale-free networks in cell biology

by Réka Albert - JOURNAL OF CELL SCIENCE
"... A cell’s behavior is a consequence of the complex interactions between its numerous constituents, such as DNA, RNA, proteins and small molecules. Cells use signaling pathways and regulatory mechanisms to coordinate multiple processes, allowing them to respond to and adapt to an ever-changing environ ..."
Abstract - Cited by 203 (6 self) - Add to MetaCart
A cell’s behavior is a consequence of the complex interactions between its numerous constituents, such as DNA, RNA, proteins and small molecules. Cells use signaling pathways and regulatory mechanisms to coordinate multiple processes, allowing them to respond to and adapt to an ever-changing environment. The large number of components, the degree of interconnectivity and the complex control of cellular networks are becoming evident in the integrated genomic and proteomic analyses that are emerging. It is increasingly recognized that the understanding of properties that arise from whole-cell function require integrated, theoretical descriptions of the relationships between different cellular components. Recent

STRING v9.1: protein-protein interaction networks, with increased coverage and integration

by Andrea Franceschini, Damian Szklarczyk, Sune Frankild, Michael Kuhn, Milan Simonovic, Er Roth, Jianyi Lin, Pablo Minguez, Peer Bork, Christian Von Mering, Lars J. Jensen - Nucleic Acids Res , 2013
"... Complete knowledge of all direct and indirect inter-actions between proteins in a given cell would represent an important milestone towards a com-prehensive description of cellular mechanisms and functions. Although this goal is still elusive, consid-erable progress has been made—particularly for ce ..."
Abstract - Cited by 183 (9 self) - Add to MetaCart
Complete knowledge of all direct and indirect inter-actions between proteins in a given cell would represent an important milestone towards a com-prehensive description of cellular mechanisms and functions. Although this goal is still elusive, consid-erable progress has been made—particularly for certain model organisms and functional systems. Currently, protein interactions and associations are annotated at various levels of detail in online resources, ranging from raw data repositories to highly formalized pathway databases. For many applications, a global view of all the available inter-action data is desirable, including lower-quality data and/or computational predictions. The STRING database
(Show Context)

Citation Context

...tworks (9,55–57). We chose a random background model that preserves the degree distribution of the proteins in a given list: the Random Graph with Given Degree Sequence (RGGDS), similar to references =-=(55,57)-=-. Given a list L of proteins, let XL denote the number of edges connecting proteins in an RGGDS with similar size as L. For the given L, a strong edge enrichment Figure 2. Network visualization and st...

Modeling interactome: scale-free or geometric?

by N. Pržulj, D. G. Corneil, I. Jurisica - BIOINFORMATICS , 2004
"... ..."
Abstract - Cited by 116 (3 self) - Add to MetaCart
Abstract not found
(Show Context)

Citation Context

...S.cerevisiae resulting from different high-throughput studies (Uetz et al., 2000; Xenarios et al., 2000; Ito et al., 2001) have been shown to have scale-free degree distributions (Jeong et al., 2001; =-=Maslov and Sneppen, 2002-=-). They have hierarchical structures with C(k) scaling as k −1 (Barabási et al., 2003). The degree distributions of this yeast PPI network, as well as the PPI network of the bacterium Helicobacter pyl...

Mapping anatomical connectivity patterns of human cerebral cortex using in vivo diffusion tensor imaging tractography

by Gaolang Gong , Yong He , Luis Concha , Catherine Lebel , Donald W Gross , Alan C Evans , Christian Beaulieu - Cerebral Cortex , 2009
"... Gaolang Gong and Yong He have contributed equally to this work The characterization of the topological architecture of complex networks underlying the structural and functional organization of the brain is a basic challenge in neuroscience. However, direct evidence for anatomical connectivity netwo ..."
Abstract - Cited by 107 (19 self) - Add to MetaCart
Gaolang Gong and Yong He have contributed equally to this work The characterization of the topological architecture of complex networks underlying the structural and functional organization of the brain is a basic challenge in neuroscience. However, direct evidence for anatomical connectivity networks in the human brain remains scarce. Here, we utilized diffusion tensor imaging deterministic tractography to construct a macroscale anatomical network capturing the underlying common connectivity pattern of human cerebral cortex in a large sample of subjects (80 young adults) and further quantitatively analyzed its topological properties with graph theoretical approaches. The cerebral cortex was divided into 78 cortical regions, each representing a network node, and 2 cortical regions were considered connected if the probability of fiber connections exceeded a statistical criterion. The topological parameters of the established cortical network (binarized) resemble that of a ''small-world'' architecture characterized by an exponentially truncated power-law distribution. These characteristics imply high resilience to localized damage. Furthermore, this cortical network was characterized by major hub regions in association cortices that were connected by bridge connections following long-range white matter pathways. Our results are compatible with previous structural and functional brain networks studies and provide insight into the organizational principles of human brain anatomical networks that underlie functional states.
(Show Context)

Citation Context

... Lrand p are the mean clustering coefficient and characteristic path length of 1000 matched random networks that preserve the same number of nodes, edges, and degree distribution as the real network (=-=Maslov and Sneppen 2002-=-; Sporns and Zwi 2004). Of note, these topological parameters may change with the selection of statistical threshold. When the statistical criterion is stiffened, fewer connections will survive, leadi...

Biological network comparison using graphlet degree distribution

by Nataša Pržulj - Bioinformatics
"... Motivation: Analogous to biological sequence comparison, comparing cellular networks is an important problem that could provide insight into biological understanding and therapeutics. For technical reasons, comparing large networks is computationally infeasible, and thus heuristics, such as the degr ..."
Abstract - Cited by 102 (1 self) - Add to MetaCart
Motivation: Analogous to biological sequence comparison, comparing cellular networks is an important problem that could provide insight into biological understanding and therapeutics. For technical reasons, comparing large networks is computationally infeasible, and thus heuristics, such as the degree distribution, clustering coefficient, diameter, and relative graphlet frequency distribution have been sought. It is easy to demonstrate that two networks are different by simply showing a short list of properties in which they differ. It is much harder to show that two networks are similar, as it requires demonstrating their similarity in all of their exponentially many properties. Clearly, it is computationally prohibitive to analyze all network properties, but the larger the number of constraints we impose in determining network similarity, the more likely it

Disrupted small-world networks in schizophrenia

by Zhening Liu, Tianzi Jiang - Brain, 131 (Pt , 2008
"... The human brain has been described as a large, sparse, complex network characterized by efficient small-world properties, which assure that the brain generates and integrates informationwith high efficiency.Many previous neuroimaging studies have provided consistent evidence of ‘dysfunctional connec ..."
Abstract - Cited by 95 (9 self) - Add to MetaCart
The human brain has been described as a large, sparse, complex network characterized by efficient small-world properties, which assure that the brain generates and integrates informationwith high efficiency.Many previous neuroimaging studies have provided consistent evidence of ‘dysfunctional connectivity ’ among the brain regions in schizophrenia; however, little is known about whether or not this dysfunctional connectivity causes disruption of the topological properties of brain functional networks.To this end, we investigated the topological properties of human brain functional networks derived from resting-state functional magnetic resonance imaging (fMRI). Data was obtained from 31 schizophrenia patients and 31healthy subjects; then functional connectivity between 90 cortical and sub-cortical regions was estimated by partial correlation analysis and thresholded to construct a set of undirected graphs. Our findings demonstrated that the brain functional networks had efficient small-world properties in the healthy subjects; whereas these properties were disrupted in the patients with schizophrenia. Brain functional networks have efficient small-world properties which support efficient parallel information transfer at a relatively low cost. More importantly, in patients with schizophrenia the small-world topological properties are significantly altered in many brain regions in the prefrontal, parietal and temporal

Pairwise global alignment of protein interaction networks by matching neighborhood topology

by Rohit Singh, Jinbo Xu, Bonnie Berger - Proceedings of the 11th Annual International Conference on Computational Molecular Biology (RECOMB’07 , 2007
"... Abstract. We describe an algorithm, IsoRank, for global alignment of two protein-protein interaction (PPI) networks. IsoRank aims to max-imize the overall match between the two networks; in contrast, much of previous work has focused on the local alignment problem | identify-ing many possible alignm ..."
Abstract - Cited by 90 (3 self) - Add to MetaCart
Abstract. We describe an algorithm, IsoRank, for global alignment of two protein-protein interaction (PPI) networks. IsoRank aims to max-imize the overall match between the two networks; in contrast, much of previous work has focused on the local alignment problem | identify-ing many possible alignments, each corresponding to a local region of similarity. IsoRank is guided by the intuition that a protein should be matched with a protein in the other network if and only if the neighbors of the two proteins can also be well matched. We encode this intuition as an eigenvalue problem, in a manner analogous to Google's PageRank method. We use IsoRank to compute the rst known global alignment between the S. cerevisiae and D. melanogaster PPI networks. The com-mon subgraph has 1420 edges and describes conserved functional compo-nents between the two species. Comparisons of our results with those of a well-known algorithm for local network alignment indicate that the glob-ally optimized alignment resolves ambiguity introduced by multiple local alignments. Finally, we interpret the results of global alignment to iden-tify functional orthologs between yeast and y; our functional ortholog prediction method is much simpler than a recently proposed approach and yet provides results that are more comprehensive. 1
(Show Context)

Citation Context

... the algorithm's error-tolerance, wesrst extracted a 200-node subgraph of the yeast PPI network. We then randomized a fraction p of its edges using the MaslovSneppen trick that preserves node degrees =-=[19]-=-: we randomly choose two edges (a; b) and (c; d), remove them, and introduce new edges (a; d) and (c; b). We 5 10 15 20 25 30 35 40 45 50 0.1 0.3 0.5 0.7 0.9 Percent of randomized edges F ra c ti o ns...

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University