A Single Source Optimal Reachable Path Query Method for Gene Regulatory Network

With the in-depth study of gene regulatory network, the reconstruction technology of gene regulatory network based on gene expression data has become increasingly mature. In the study of targeted gene mapping in gene regulatory networks, querying the acting path of targeted drugs can be transformed into a process of path querying on a probability graph. On this basis, evaluating the reachable path in a probability graph requires comprehensive consideration of both path existence probability and path length. However, the existing path query method of probability graphs can only convert the probability graph into a determined graph, and then uses the query algorithm on the determined graph to query. This will lead to the path query process unable to take into account both the path existence probability and path length at the same time, thus failing to meet the needs of targeted gene mapping research. Therefore, this paper proposes an optimal path query algorithm Dual-element Optimal Reachable Path Query Algorithm (DOP) based on the gene regulatory network represented by the probability graph. The algorithm will comprehensively evaluate both the probability of the path existence and the path length to query the optimal path, providing an important reference for targeted gene mapping research.