Opinion
Improved Algorithm of Blocking the Selected Edges in the Digraph
Received Date: October 02, 2019; Published Date: October 11, 2019
Abstract
In this paper, a protein network represented by a directed graph is considered. The problem of determining the minimum number of edges that break paths from the input proteins of the network to the output ones and passing through some subset of proteins in this network is analyzing. An improved algorithm based on a selection of connectivity components in the sub-graph with dedicated subset of nodes is suggesting.
Keywords: Cluster; Digraph; Sub-graph; Protein network; Connectivity component
-
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Signup for Newsletter
