Dataset Information

Hamiltonian energy as an efficient approach to identify the significant key regulators in biological networks.

ABSTRACT: The topological characteristics of biological networks enable us to identify the key nodes in terms of modularity. However, due to a large size of the biological networks with many hubs and functional modules across intertwined layers within the network, it often becomes difficult to accomplish the task of identifying potential key regulators. We use for the first time a generalized formalism of Hamiltonian Energy (HE) with a recursive approach. The concept, when applied to the Apoptosis Regulatory Gene Network (ARGN), helped us identify 11 Motif hubs (MHs), which influenced the network up to motif levels. The approach adopted allowed to classify MHs into 5 significant motif hubs (S-MHs) and 6 non-significant motif hubs (NS-MHs). The significant motif hubs had a higher HE value and were considered as high-active key regulators; while the non-significant motif hubs had a relatively lower HE value and were considered as low-active key regulators, in network control mechanism. Further, we compared the results of the HE analyses with the topological characterization, after subjecting to the three conditions independently: (i) removing all MHs, (ii) removing only S-MHs, and (iii) removing only NS-MHs from the ARGN. This procedure allowed us to cross-validate the role of 5 S-MHs, NFk-B1, BRCA1, CEBPB, AR, and POU2F1 as the potential key regulators. The changes in HE calculations further showed that the removal of 5 S-MHs could cause perturbation at all levels of the network, a feature not discernible by topological analysis alone.

SUBMITTER: Haider S

PROVIDER: S-EPMC6707611 | biostudies-literature | 2019

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

Hamiltonian energy as an efficient approach to identify the significant key regulators in biological networks.

Haider Shazia S Ponnusamy Kalaiarasan K Singh R K Brojen RKB Chakraborti Anirban A Bamezai Rameshwar N K RNK

PloS one 20190823 8

The topological characteristics of biological networks enable us to identify the key nodes in terms of modularity. However, due to a large size of the biological networks with many hubs and functional modules across intertwined layers within the network, it often becomes difficult to accomplish the task of identifying potential key regulators. We use for the first time a generalized formalism of Hamiltonian Energy (HE) with a recursive approach. The concept, when applied to the Apoptosis Regulat ...[more]

PMID: 31442253

Similar Datasets

Project description:BackgroundClearly visualized biopathways provide a great help in understanding biological systems. However, manual drawing of large-scale biopathways is time consuming. We proposed a grid layout algorithm that can handle gene-regulatory networks and signal transduction pathways by considering edge-edge crossing, node-edge crossing, distance measure between nodes, and subcellular localization information from Gene Ontology. Consequently, the layout algorithm succeeded in drastically reducing these crossings in the apoptosis model. However, for larger-scale networks, we encountered three problems: (i) the initial layout is often very far from any local optimum because nodes are initially placed at random, (ii) from a biological viewpoint, human layouts still exceed automatic layouts in understanding because except subcellular localization, it does not fully utilize biological information of pathways, and (iii) it employs a local search strategy in which the neighborhood is obtained by moving one node at each step, and automatic layouts suggest that simultaneous movements of multiple nodes are necessary for better layouts, while such extension may face worsening the time complexity.ResultsWe propose a new grid layout algorithm. To address problem (i), we devised a new force-directed algorithm whose output is suitable as the initial layout. For (ii), we considered that an appropriate alignment of nodes having the same biological attribute is one of the most important factors of the comprehension, and we defined a new score function that gives an advantage to such configurations. For solving problem (iii), we developed a search strategy that considers swapping nodes as well as moving a node, while keeping the order of the time complexity. Though a naïve implementation increases by one order, the time complexity, we solved this difficulty by devising a method that caches differences between scores of a layout and its possible updates.ConclusionLayouts of the new grid layout algorithm are compared with that of the previous algorithm and human layout in an endothelial cell model, three times as large as the apoptosis model. The total cost of the result from the new grid layout algorithm is similar to that of the human layout. In addition, its convergence time is drastically reduced (40% reduction).

Dataset Information

Hamiltonian energy as an efficient approach to identify the significant key regulators in biological networks.

Publications

Hamiltonian energy as an efficient approach to identify the significant key regulators in biological networks.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets