Results 1 - 10
of
95
Power-law distributions in empirical data
- ISSN 00361445. doi: 10.1137/ 070710111. URL http://dx.doi.org/10.1137/070710111
, 2009
"... Power-law distributions occur in many situations of scientific interest and have significant consequences for our understanding of natural and man-made phenomena. Unfortunately, the empirical detection and characterization of power laws is made difficult by the large fluctuations that occur in the t ..."
Abstract
-
Cited by 607 (7 self)
- Add to MetaCart
Power-law distributions occur in many situations of scientific interest and have significant consequences for our understanding of natural and man-made phenomena. Unfortunately, the empirical detection and characterization of power laws is made difficult by the large fluctuations that occur in the tail of the distribution. In particular, standard methods such as least-squares fitting are known to produce systematically biased estimates of parameters for power-law distributions and should not be used in most circumstances. Here we describe statistical techniques for making accurate parameter estimates for power-law data, based on maximum likelihood methods and the Kolmogorov-Smirnov statistic. We also show how to tell whether the data follow a power-law distribution at all, defining quantitative measures that indicate when the power law is a reasonable fit to the data and when it is not. We demonstrate these methods by applying them to twentyfour real-world data sets from a range of different disciplines. Each of the data sets has been conjectured previously to follow a power-law distribution. In some cases we find these conjectures to be consistent with the data while in others the power law is ruled out.
A general framework for weighted gene coexpression network analysis
- STATISTICAL APPLICATIONS IN GENETICS AND MOLECULAR BIOLOGY 4: ARTICLE 17
, 2005
"... ..."
(Show Context)
Scale-free networks in cell biology
- 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
Pairwise global alignment of protein interaction networks by matching neighborhood topology
- 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
(Show Context)
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
Some protein interaction data do not exhibit power law statistics.
- FEBS Lett.
, 2005
"... Abstract It has been claimed that protein-protein interaction (PPI) networks are scale-free, and that identifying high-degree ''hub'' proteins reveals important features of PPI networks. In this paper, we evaluate the claims that PPI node degree sequences follow a power law, a n ..."
Abstract
-
Cited by 48 (6 self)
- Add to MetaCart
(Show Context)
Abstract It has been claimed that protein-protein interaction (PPI) networks are scale-free, and that identifying high-degree ''hub'' proteins reveals important features of PPI networks. In this paper, we evaluate the claims that PPI node degree sequences follow a power law, a necessary condition for networks to be scale-free. We provide two PPI network examples which clearly do not have power laws when analyzed correctly, and thus at least these PPI networks are not scale-free. We also show that these PPI networks do appear to have power laws according to methods that have become standard in the existing literature. We explain the source of this error using numerically generated data from analytic formulas, where there are no sampling or noise ambiguities.
An ensemble framework for clustering protein-protein interaction networks
- In Proc. 15th Annual Int’l Conference on Intelligent Systems for Molecular Biology (ISMB
, 2007
"... Protein-Protein Interaction (PPI) networks are believed to be important sources of information related to biological processes and complex metabolic functions of the cell. The presence of biologically relevant functional modules in these networks has been theorized by many researchers. However, the ..."
Abstract
-
Cited by 47 (4 self)
- Add to MetaCart
(Show Context)
Protein-Protein Interaction (PPI) networks are believed to be important sources of information related to biological processes and complex metabolic functions of the cell. The presence of biologically relevant functional modules in these networks has been theorized by many researchers. However, the application of traditional clustering algorithms for extracting these modules has not been successful, largely due to the presence of noisy false positive interactions as well as specific topological challenges in the network. In this paper, we propose an ensemble clustering framework to address this problem. For base clustering, we introduce two topology-based distance metrics to counteract the effects of noise. We develop a PCA-based consensus clustering technique, designed to reduce the dimensionality of the consensus problem and yield informative clusters. We also develop a soft consensus clustering variant to assign multifaceted proteins to multiple functional groups. We conduct an empirical evaluation of different consensus techniques using topology-based, information theoretic and domain-specific validation metrics and show that our approaches can provide significant benefits over other state-of-theart approaches. Our analysis of the consensus clusters obtained demonstrates that ensemble clustering can a) produce improved biologically significant functional groupings; and b) facilitate soft clustering by discovering multiple functional associations for proteins. 1.
Graph theory and networks in biology
- IET Systems Biology, 1:89 – 119
, 2007
"... In this paper, we present a survey of the use of graph theoretical techniques in Biology. In particular, we discuss recent work on identifying and modelling the structure of bio-molecular networks, as well as the application of centrality measures to interaction networks and research on the hierarch ..."
Abstract
-
Cited by 43 (0 self)
- Add to MetaCart
(Show Context)
In this paper, we present a survey of the use of graph theoretical techniques in Biology. In particular, we discuss recent work on identifying and modelling the structure of bio-molecular networks, as well as the application of centrality measures to interaction networks and research on the hierarchical structure of such networks and network motifs. Work on the link between structural network properties and dynamics is also described, with emphasis on synchronization and disease propagation. 1
Network neighborhood analysis with the multi-node topological overlap measure
- Bioinformatics
"... ..."
(Show Context)
Assessing significance of connectivity and conservation in protein interaction networks
- Journal of Computational Biology
, 2006
"... Computational and comparative analysis of protein-protein interaction (PPI) networks enable understanding of the modular organization of the cell through identification of functional modules and protein complexes. These analysis techniques generally rely on topological features such as connectedness ..."
Abstract
-
Cited by 25 (5 self)
- Add to MetaCart
(Show Context)
Computational and comparative analysis of protein-protein interaction (PPI) networks enable understanding of the modular organization of the cell through identification of functional modules and protein complexes. These analysis techniques generally rely on topological features such as connectedness, based on the premise that functionally related proteins are likely to interact densely and that these interactions follow similar evolutionary trajectories. Significant recent work in our lab, and in other labs has focused on efficient algorithms for identification of modules and their conservation. Application of these methods to a variety of networks has yielded novel biological insights. In spite of algorithmic advances, development of a comprehensive infrastructure for interaction databases is in relative infancy compared to corresponding sequence analysis tools such as BLAST and CLUSTAL. One critical component of this infrastructure is a measure of the statistical significance of a match or a dense subcomponent. Corresponding sequence-based measures such as E-values are key components of sequence matching tools. In the absence of an analytical measure, conventional methods rely on computer simulations based on ad-hoc models for quantifying significance. This paper presents the first such effort, to the best of our knowledge, aimed at analytically quantifying statistical significance
Causal connectivity of evolved neural networks during behavior.
- Network: Computation in Neural Systems,
, 2005
"... Abstract. To show how causal interactions in neural dynamics are modulated by behavior, it is valuable to analyze these interactions without perturbing or lesioning the neural mechanism. This paper proposes a method, based on a graph-theoretic extension of vector autoregressive modeling and 'G ..."
Abstract
-
Cited by 24 (4 self)
- Add to MetaCart
Abstract. To show how causal interactions in neural dynamics are modulated by behavior, it is valuable to analyze these interactions without perturbing or lesioning the neural mechanism. This paper proposes a method, based on a graph-theoretic extension of vector autoregressive modeling and 'Granger causality', for characterizing causal interactions generated within intact neural mechanisms. This method, called causal connectivity analysis, is illustrated via model neural networks optimized for controlling target fixation in a simulated head-eye system, in which the structure of the environment can be experimentally varied. Causal connectivity analysis of this model yields novel insights into neural mechanisms underlying sensorimotor coordination. In contrast to networks supporting comparatively simple behavior, networks supporting rich adaptive behavior show a higher density of causal interactions, as well as a stronger causal flow from sensory inputs to motor outputs. They also show different arrangements of 'causal sources' and 'causal sinks': nodes that differentially affect, or are affected by, the remainder of the network. Finally, analysis of causal connectivity can predict the functional consequences of network lesions. These results suggest that causal connectivity analysis may have useful applications in the analysis of neural dynamics.