Identifying common components across biological network graphs using a bipartite data model
نویسندگان
چکیده
The GeneWeaver bipartite data model provides an efficient means to evaluate shared molecular components from sets derived across diverse species, disease states and biological processes. In order to adapt this model for examining related molecular components and biological networks, such as pathway or gene network data, we have developed a means to leverage the bipartite data structure to extract and analyze shared edges. Using the Pathway Commons database we demonstrate the ability to rapidly identify shared connected components among a diverse set of pathways. In addition, we illustrate how results from maximal bipartite discovery can be decomposed into hierarchical relationships, allowing shared pathway components to be mapped through various parent-child relationships to help visualization and discovery of emergent kernel driven relationships. Interrogating common relationships among biological networks and conventional GeneWeaver gene lists will increase functional specificity and reliability of the shared biological components. This approach enables self-organization of biological processes through shared biological networks.
منابع مشابه
Spectral Co-Clustering for Dynamic Bipartite Graphs
A common task in many domains with a temporal aspect involves identifying and tracking clusters over time. Often dynamic data will have a feature-based representation. In some cases, a direct mapping will exist for both objects and features over time. But in many scenarios, smaller subsets of objects or features alone will persist across successive time periods. To address this issue, we propos...
متن کاملA nonlinear model for common weights set identification in network Data Envelopment Analysis
In the Data Envelopment Analysis (DEA) the efficiency of the units can be obtained by identifying the degree of the importance of the criteria (inputs-outputs).In DEA basic models, challenges are zero and unequal weights of the criteria when decision- making units are evaluated. One of the strategies applied to deal with these problems is using common weights of the each input...
متن کاملEfficient Detection of Communities in Biological Bipartite Networks
Methods to efficiently uncover and extract community structures are required in a number of biological applications where networked data and their interactions can be modeled as graphs, and observing tightly-knit groups of vertices (“communities”) can offer insights into the structural and functional building blocks of the underlying network. Classical applications of community detection have l...
متن کاملTwo classes of bipartite networks: nested biological and social systems.
Bipartite graphs have received some attention in the study of social networks and of biological mutualistic systems. A generalization of a previous model is presented, that evolves the topology of the graph in order to optimally account for a given contact preference rule between the two guilds of the network. As a result, social and biological graphs are classified as belonging to two clearly ...
متن کاملUse of Eigenvalue and Eigenvectors to Analyze Bipartivity of Network Graphs
This paper presents the applications of Eigenvalues and Eigenvectors (as part of spectral decomposition) to analyze the bipartivity index of graphs as well as to predict the set of vertices that will constitute the two partitions of graphs that are truly bipartite and those that are close to being bipartite. Though the largest eigenvalue and the corresponding eigenvector (called the principal e...
متن کامل