A shortest path-based approach for copy number variation detection from next-generation sequencing data [PDF]
Copy number variation (CNV) is one of the main structural variations in the human genome and accounts for a considerable proportion of variations. As CNVs can directly or indirectly cause cancer, mental illness, and genetic disease in humans, their ...
Guojun Liu, Hongzhi Yang, Xiguo Yuan
doaj +2 more sources
Neutrosophic Shortest Path Problem [PDF]
Neutrosophic set theory provides a new tool to handle the uncertainties in shortest path problem (SPP). This paper introduces the SPP from a source node to a destination node on a neutrosophic graph in which a positive neutrosophic number is assigned to ...
Ranjan Kumar+4 more
doaj +3 more sources
Shortest path counting in probabilistic biological networks [PDF]
Background Biological regulatory networks, representing the interactions between genes and their products, control almost every biological activity in the cell.
Yuanfang Ren, Ahmet Ay, Tamer Kahveci
doaj +2 more sources
TD-H2H: Shortest Path Query on Time-Dependent Graphs [PDF]
A shortest path query on road networks is a fundamental problem, which has been studied widely. Existing studies usually model road networks as a static graph and query the path with the shortest distance between given vertices.
LI Xinling, WANG Yishu, YUAN Ye, GU Xiang, WANG Guoren
doaj +1 more source
A Modification of Shortest Path Algorithm According to Adjustable Weights Based on Dijkstra Algorithm [PDF]
It is possible to represent the road map on the paper and study it using Dijkstra`s algorithm to find the shortest path on the real earth. Dijkstra`s Algorithms are used for calculating the shortest path from source to sink to enable query operations ...
Luay Jabbar, Eyad Abass, Sundus Hasan
doaj +1 more source
Multi-Objective Decision-Making Meets Dynamic Shortest Path: Challenges and Prospects
The Shortest Path (SP) problem resembles a variety of real-world situations where one needs to find paths between origins and destinations. A generalization of the SP is the Dynamic Shortest Path (DSP) problem, which also models changes in the graph at ...
Juarez Machado da Silva+2 more
doaj +1 more source
Shortest Path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm
The shortest path is an issue that involves the route from one point (nodes) to another. It is to find a path with a minimum travelling time. Nowadays, traffic problems have affected many transport users especially in Kuala Lumpur area.
Nur Syuhada Muhammat Pazil+2 more
doaj +5 more sources
Parallel Privacy-Preserving Shortest Path Algorithms
In this paper, we propose and present secure multiparty computation (SMC) protocols for single-source shortest distance (SSSD) and all-pairs shortest distance (APSD) in sparse and dense graphs.
Mohammad Anagreh+2 more
doaj +1 more source
Commentary - Methods to find all the edges on any of the shortest paths between two given nodes of a directed acyclic graph [PDF]
This article puts forth all the existing methods proposed by the various authors of the Stack Exchange community to find all the edges on any shortest path between two given nodes of a directed acyclic graph. For a directed acyclic graph with N number of
Deepak Ahire, Omkar Jadhav
doaj +3 more sources
Design and Calculation of Evaluation Index for Urban Road Anti-Blocking Ability
Aiming at the lack of an anti-clogging ability index in the road network traffic evaluation index, an anti-clogging ability index was proposed to measure the anti-clogging ability of urban road traffic network: Κ-anti-clogging coefficient, which is used ...
Ronghu Zhou, Qin Ge
doaj +1 more source