Discovering weighted motifs in gene co-expression networks

  title={Discovering weighted motifs in gene co-expression networks},
  author={Sarvenaz Choobdar and P. Ribeiro and Fernando Silva},
  journal={Proceedings of the 30th Annual ACM Symposium on Applied Computing},
A important dimension of complex networks is embedded in the weights of its edges. Incorporating this source of information on the analysis of a network can greatly enhance our understanding of it. This is the case for gene co-expression networks, which encapsulate information about the strength of correlation between gene expression profiles. Classical unweighted gene co-expression networks use thresholding for defining connectivity, losing some of the information contained in the different… Expand
An approach for analyzing and classifying microarray data using gene co-expression networks cycles
The main results show that the stoichiometric relationship between genes involved in apoptosis, glucolysis, cell cycle and NFκB pathways is unbalanced in GBM samples versus control samples, which provides a better understanding of the biology of tumors. Expand
Random walk patterns to identify weighted motifs
This work proposed a novel methodology based on a random walker and a fixed maximum number of steps to study weighted motifs of limited size and found that identified similarities enable the classifications of systems according to functioning mechanisms associated with specific configurations. Expand
Mine weighted network motifs via Bayes' theorem
This paper firstly model the heterogeneous weights as a fuzzy number problem, and normalize them into binary packages; then it neglect the time-consuming Markov process and discriminate weighted subgraphs by Bayes' equation, showing that the method is feasible and applicable. Expand
GeNNet: an integrated platform for unifying scientific workflows and graph databases for transcriptome data analysis
GeNNet is the first platform to integrate the analytical process of transcriptome data with graph databases and provides a comprehensive set of tools that would otherwise be challenging for non-expert users to install and use. Expand


Motif Mining in Weighted Networks
A new method to incorporate edge weight information in motif mining by embedding the weight distribution in subgraphs and it is based on weight entropy, which does not require the generation of random networks, and is also computationally faster. Expand
A General Framework for Weighted Gene Co-Expression Network Analysis
  • Bin Zhang, S. Horvath
  • Mathematics, Medicine
  • Statistical applications in genetics and molecular biology
  • 2005
A general framework for `soft' thresholding that assigns a connection weight to each gene pair is described and several node connectivity measures are introduced and provided empirical evidence that they can be important for predicting the biological significance of a gene. Expand
Characterizing Motifs in Weighted Complex Networks
The local structure of unweighted complex networks can be characterized by the occurrence frequencies of subgraphs in the network. Frequently occurring subgraphs, motifs, have been related to theExpand
Weighted Frequent Gene Co-expression Network Mining to Identify Genes Involved in Genome Stability
The co-expression network directed approach provides a powerful tool for understanding cancer physiology, predicting new gene functions, as well as providing new target candidates for cancer therapeutics. Expand
Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking
A novel algorithm for discovering large network motifs that achieves these goals, based on a novel symmetry-breaking technique, which eliminates repeated isomorphism testing, leading to an exponential speed-up over previous methods. Expand
Gene connectivity, function, and sequence conservation: predictions from modular yeast co-expression networks
Application of these techniques can allow a finer scale prediction of relative gene importance for a particular process within a group of similarly expressed genes. Expand
g-tries: an efficient data structure for discovering network motifs
The results show that indeed, g-tries are a feasible, adequate and very efficient data structure for network motifs discovery, clearly outperforming previous algorithms and data structures. Expand
Geometric Interpretation of Gene Coexpression Network Analysis
This work describes conditions when a close relationship exists between network analysis and microarray data analysis techniques, and provides a rough dictionary for translating between the two fields. Expand
Efficient Detection of Network Motifs
  • S. Wernicke
  • Computer Science, Medicine
  • IEEE/ACM Transactions on Computational Biology and Bioinformatics
  • 2006
Experiments on a testbed of biological networks show the new algorithms to be orders of magnitude faster than previous approaches, allowing for the detection of larger motifs in bigger networks than previously possible and thus facilitating deeper insight into the field. Expand
Understanding network concepts in modules
Using protein-protein interaction, gene co-expression, and simulated data, it is shown that many networks comprised of module nodes are approximately factorizable and in these types of networks, simple relationships exist between seemingly disparate network concepts. Expand