| Literature DB >> 35712516 |
Jipeng Yan1, Zhuo Hu2, Zong-Wei Li2, Shiren Sun1, Wei-Feng Guo2,3.
Abstract
Due to rapid development of high-throughput sequencing and biotechnology, it has brought new opportunities and challenges in developing efficient computational methods for exploring personalized genomics data of cancer patients. Because of the high-dimension and small sample size characteristics of these personalized genomics data, it is difficult for excavating effective information by using traditional statistical methods. In the past few years, network control methods have been proposed to solve networked system with high-dimension and small sample size. Researchers have made progress in the design and optimization of network control principles. However, there are few studies comprehensively surveying network control methods to analyze the biomolecular network data of individual patients. To address this problem, here we comprehensively surveyed complex network control methods on personalized omics data for understanding tumor heterogeneity in precision medicine of individual patients with cancer.Entities:
Keywords: cancer individual patients; network control principles; personalized omics; precision medicine; tumor heterogeneity
Year: 2022 PMID: 35712516 PMCID: PMC9195174 DOI: 10.3389/fonc.2022.891676
Source DB: PubMed Journal: Front Oncol ISSN: 2234-943X Impact factor: 5.738
Figure 1Overview of our review. The contents of our review consist of three parts. Firstly, we summarized the works to construct personalized gene interaction network from genomics of individual patients. Then on the personalized gene interaction networks, we pointed out how to identify personalized driver gene by using network control tools. Finally, we described how to discover synergistic drug combinations by targeting personalized driver genes.
Figure 2The principles of different network control methods. (A) Concept demonstration of network control methods. Network control tools aim to detect a small number of driver nodes which form the input matrix and are injected by the input signals for driving the state transition of high dimension networked system depending on adequate knowledge of the network structure. (B) MDS based control methods. If the connected edges of MDS are removed, there will be no edges in the network. By assuming that the driving node can independently control all neighbor nodes, the minimum dominating set (MDS) in the undirected network is taken as the set of driver nodes, and the red node represents the minimum driving node. (C) DFVS based control methods. The red nodes represent the minimum set of feedback nodes (FVS), that is, if the connected edges of FVS are removed, there will be no loops in the network. For FVS based control methods, by controlling the nodes in FVS, the whole system can be transformed from one stable attractor to another attractor. (D) MMS based control methods. The directed network is transformed into a bipartite graph. For the bipartite graph, the upper side represents the out degree of the original network, while the bottom side represent the in degree of the original network nodes. If there is an edge from one node to another node in the original network, an edge connecting these two nodes is added to the bipartite graph. According to the maximum matching of bipartite graph, the maximum matching (i.e., red edges) can be obtained, and 6 unmatched nodes (i.e., red nodes) can be found in the bottom side of bipartite graph. By controlling these 6 nodes, the system structure can be completely controllable for MMS based control methods. (E) NCUA based control methods. Firstly, the original undirected network is transformed into a bipartite graph, in which the upper side represents the nodes of the original network and the bottom side represent the edges of the original network respectively. Then, the nodes covering the nodes on the bottom side (i.e., red nodes) are obtained in the bipartite graph and are considered as driver nodes for the NCUA method. The red edges represent the links between the driver nodes and the nodes of bottom side in the bipartite graph.