Decomposition Algorithms of Blocking the Selected

Edges in the Digraph

Tsitsiashvili Gurami

Conceptual Paper

Decomposition Algorithms of Blocking the Selected Edges in the Digraph

Tsitsiashvili Gurami*

Institute for Applied Mathematics FEB RAS, Russia

Corresponding Author

Received Date: October 17, 2019; Published Date: October 22, 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. A decomposition algorithms are basing on a selection of classes of cyclically equivalent nodes in the sub-graphs with dedicated subset of nodes is suggesting.

Keywords: Cluster; Digraph; Sub-graph; Protein network; Connectivity component

Article Details

Citation

Tsitsiashvili Gurami. Decomposition Algorithms of Blocking the Selected Edges in the Digraph. Annal Biostat & Biomed Appli. 3(3): 2019. ABBA.MS.ID.000562.