Calculation of Flows Intensities Transformations in Acyclic Directed Networks

Abstract

The problem considered in this paper is discussing last year’s sufficiently intensively in different biological journals [1-3]. In Tsitsiashvili [4] a problem of a decomposition of balance equations for flows intensities in queuing networks is solving. Such problem is connecting with calculation of flows intensities of proteins networks. Main idea of this procedure is to find clusters with cyclically equivalent nodes and order them by their maximal distance from input clusters so that direct edges may be only from clusters with smaller to clusters with larger distances. Therefore, it is possible to divide all nodes into sets A0,A1,...,Ap so that every edge of the graph is only from node i ∈ At to node j ∈ Aq, t

查看原文

分享

微信好友 朋友圈 QQ好友 复制链接

本刊更多论文

无循环有向网络中流强度变换的计算

本文考虑的问题是在不同的生物学期刊上对去年的问题进行了充分深入的讨论[1-3]。在Tsitsiashvili b[4]中，求解了排队网络中流强度平衡方程的分解问题。这一问题与蛋白质网络流动强度的计算有关。该过程的主要思想是寻找具有循环等效节点的簇，并根据它们与输入簇的最大距离对它们进行排序，以便直接边只能从较小的簇到较大距离的簇。因此，可以将所有节点划分为集合A0,A1，…，Ap使得图的每条边仅从节点i∈At到节点j∈Aq, t

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文 去求助

相关文献