Subnetwork hierarchies of biochemical pathways
By Petter Holme, M. Huss, Hawoong Jeong. Bioinform., 2002
360 citations recorded by the source corpus.
MOTIVATION The vastness and complexity of the biochemical networks that have been mapped out by modern genomics calls for decomposition into subnetworks. Such networks can have inherent non-local features that require the global structure to be taken into account in the decomposition procedure. Furthermore, basic questions such as to what extent the network (graph theoretically) can be said to be built by distinct subnetworks are little studied. RESULTS We present a method to decompose biochemical networks into subnetworks based on the global geometry of the network. This method enables us to analyze the full hierarchical organization of biochemical networks and is applied to 43 organisms from the WIT database. Two types of biochemical networks are considered: metabolic networks and whole-cellular networks (also including for example information processes). Conceptual and quantitative ways of describing the hierarchical ordering are discussed. The general picture of the metabolic networks arising from our study is that of a few core-clusters centred around the most highly connected substances enclosed by other substances in outer shells, and a few other well-defined subnetworks. AVAILABILITY An implementation of our algorithm and other programs for analyzing the data is available from http://www.tp.umu.se/forskning/networks/meta/ SUPPLEMENTARY INFORMATION Supplementary material is available at http://www.tp.umu.se/forskning/networks/meta/
Subfields: Computer Vision and Pattern Recognition, Molecular Biology
View Paper: https://www.semanticscholar.org/paper/427442782ce605dc726d79da93ec510ec63f8d04
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Vision and Pattern Recognition
- Santo Fortunato
- Alex Arenas
- Sergio Gómez
- Alberto Fernández
- Aaron Clauset
- Roger Guimerà
- Luís A. Nunes Amaral
- Albert Díaz-Guilera
In Molecular Biology
- Santo Fortunato
- Mark Newman
- Alex Arenas
- Aaron Clauset
- Sergio Gómez
- Olaf Sporns
- M. A. Porter
- Jure Leskovec
Citations in the corpus
- Community detection in graphs (2009, methodology): “[164], by using a hierarchical clustering technique inspired by the algorithm by Girvan and Newman (Section 5.”
- Analysis of the structure of complex networks at different resolution levels (2007, background): “This is the case, for example in the worldwide airports network [6], the WWW [7], biological networks [8, 9, 10], social networks [3, 11] and the Internet [12, 13], among others.”
- Finding community structure in networks using the eigenvectors of matrices. (2006, background): “Social networks [5], biochemical networks [7, 8, 9], and information networks such as the web [10], have all been shown to possess strong community structure, a finding that has substantial practical implications for our understanding of the systems these networks represent.”
- Using graph theory to analyze biological networks (2011, background): “It has been shown that metabolic networks can form hierarchical structures [168,169] where specific patterns and motifs are overrepresented.”
- Protein-to-protein interactions: Technologies, databases, and algorithms (2010, background): “…and reconstruction of metabolic networks; (ii) determination of evolution of networks; (iii) pathway analysis (e.g., comparison or alignment); and (iv) integration of genomic and proteomic data [Schuster et al. 2002; Yeger-Lotem et al. 2004; Holme et al. 2003; Xiong et al. 2004; Przulj et al.”
- Structure and inference in annotated networks (2015, background): “The maximum of the right-hand side of this inequality with respect to possible choices of the distribution q(s) coincides with the exact equality, which, following equation (5), is when”
- The Structure and Function of Complex Networks (2003, methodology): “Recently a number of authors have had success with methods based on “edge betweenness,” which is the count of how many geodesic paths between vertices run along each edge in the network [171, 185, 197, 422].”
- Fast algorithm for detecting community structure in networks. (2003, background): “…identify such structure with some sensitivity, and this algorithm has been employed by a number of authors in the study of such diverse systems as networks of email messages, social networks of animals, collaborations of jazz musicians, metabolic networks, and gene networks [5, 6, 7, 8, 9, 10, 11].”
- Global organization of metabolic fluxes in the bacterium Escherichia coli (2004, background): “Black dotted lines indicate where the disconnected pathways, for example, folate biosynthesis (4), would connect to the cluster through a link that is not part”
- Modularity and community structure in networks. (2006, neutral): “Modularity and community structure in networks”
- Mixing patterns in networks. (2002, background): “Examples include resilience to the deletion of network nodes [8, 9, 10, 11, 12], navigability or searchability of networks [13, 14, 15], community structure [16, 17, 18], and spectral properties [19, 20, 21].”
- Finding community structure in very large networks. (2004, background): “I. INTRODUCTION Many systems of current interest to the scientific community can usefully be represented as networks [1, 2, 3, 4].”
- Graph theory and networks in Biology. (2006, methodology): “A variant of the concept of edge-betweenness was applied to a bi-partite model of metabolic networks in the paper [177].”