Clustering incorporating shortest paths identifies relevant modules in functional interaction networks

Author(s):  
Jennifer Hallinan ◽  
Matthew Pocock ◽  
Stephen Addinall ◽  
David A Lydall ◽  
Anil Wipat
2012 ◽  
Vol 3 ◽  
Author(s):  
Anna-Lisa Paul ◽  
Fiona C. Denison ◽  
Eric R. Schultz ◽  
Agata K. Zupanska ◽  
Robert J. Ferl

Molecules ◽  
2018 ◽  
Vol 24 (1) ◽  
pp. 30 ◽  
Author(s):  
Jingpu Zhang ◽  
Lei Deng

In the past few decades, the number and variety of genomic and proteomic data available have increased dramatically. Molecular or functional interaction networks are usually constructed according to high-throughput data and the topological structure of these interaction networks provide a wealth of information for inferring the function of genes or proteins. It is a widely used way to mine functional information of genes or proteins by analyzing the association networks. However, it remains still an urgent but unresolved challenge how to combine multiple heterogeneous networks to achieve more accurate predictions. In this paper, we present a method named ReprsentConcat to improve function inference by integrating multiple interaction networks. The low-dimensional representation of each node in each network is extracted, then these representations from multiple networks are concatenated and fed to gcForest, which augment feature vectors by cascading and automatically determines the number of cascade levels. We experimentally compare ReprsentConcat with a state-of-the-art method, showing that it achieves competitive results on the datasets of yeast and human. Moreover, it is robust to the hyperparameters including the number of dimensions.


2011 ◽  
Vol 2011 ◽  
pp. 1-14 ◽  
Author(s):  
Gaston K. Mazandu ◽  
Nicola J. Mulder

Technological developments in large-scale biological experiments, coupled with bioinformatics tools, have opened the doors to computational approaches for the global analysis of whole genomes. This has provided the opportunity to look at genes within their context in the cell. The integration of vast amounts of data generated by these technologies provides a strategy for identifying potential drug targets within microbial pathogens, the causative agents of infectious diseases. As proteins are druggable targets, functional interaction networks between proteins are used to identify proteins essential to the survival, growth, and virulence of these microbial pathogens. Here we have integrated functional genomics data to generate functional interaction networks between Mycobacterium tuberculosis proteins and carried out computational analyses to dissect the functional interaction network produced for identifying drug targets using network topological properties. This study has provided the opportunity to expand the range of potential drug targets and to move towards optimal target-based strategies.


2015 ◽  
Vol 15 (1) ◽  
pp. 236-245 ◽  
Author(s):  
Omar Wagih ◽  
Naoyuki Sugiyama ◽  
Yasushi Ishihama ◽  
Pedro Beltrao

2012 ◽  
Vol 6 (1) ◽  
pp. 112 ◽  
Author(s):  
Mohammed Alshalalfa ◽  
Gary D Bader ◽  
Anna Goldenberg ◽  
Quaid Morris ◽  
Reda Alhajj

2018 ◽  
Author(s):  
Andrea Costa ◽  
Ana M. Martín González ◽  
Katell Guizien ◽  
Andrea M. Doglioli ◽  
José María Gómez ◽  
...  

Representing data as networks cuts across all sub-disciplines in ecology and evolutionary biology. Besides providing a compact representation of the interconnections between agents, network analysis allows the identification of especially important nodes, according to various metrics that often rely on the calculation of the shortest paths connecting any two nodes. While the interpretation of a shortest paths is straightforward in binary, unweighted networks, whenever weights are reported, the calculation could yield unexpected results. We analyzed 129 studies of ecological networks published in the last decade and making use of shortest paths, and discovered a methodological inaccuracy related to the edge weights used to calculate shortest paths (and related centrality measures), particularly in interaction networks. Specifically, 49% of the studies do not report sufficient information on the calculation to allow their replication, and 61% of the studies on weighted networks may contain errors in how shortest paths are calculated. Using toy models and empirical ecological data, we show how to transform the data prior to calculation and illustrate the pitfalls that need to be avoided. We conclude by proposing a five-point check-list to foster best-practices in the calculation and reporting of centrality measures in ecology and evolution studies.


2008 ◽  
Vol 37 (suppl_1) ◽  
pp. D623-D628 ◽  
Author(s):  
Atanas Kamburov ◽  
Christoph Wierling ◽  
Hans Lehrach ◽  
Ralf Herwig

2009 ◽  
Vol 8 (7) ◽  
pp. 3367-3376 ◽  
Author(s):  
Solip Park ◽  
Jae-Seong Yang ◽  
Sung Key Jang ◽  
Sanguk Kim

Sign in / Sign up

Export Citation Format

Share Document