arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1312.7306cs.CCcs.DSq-bio.MN
收藏

网络传递约简问题的数学观点及其在生物网络综合与分析中的应用

Algorithmic Perspectives of Network Transitive Reduction Problems and their Applications to Synthesis and Analysis of Biological Networks

Satabdi Aditya, Bhaskar DasGupta, Marek Karpinski

摘要:

在这篇综述论文中,我们将提出一些核心算法问题,涉及网络上的几个传递约简问题,这些问题在涉及细胞过程的网络合成和分析中有应用。我们的出发点是所谓的最小等价有向图问题,这是组合算法中的一个经典计算问题。随后,我们将考虑一些非平凡的扩展或推广这个问题的动机在系统生物学中的应用。然后,我们将讨论这些算法的方法在三个主要的生物学研究问题的背景下的应用:合成和简化信号转导网络,分析疾病网络,并测量冗余的生物网络。

英文摘要:

In this survey paper, we will present a number of core algorithmic questions concerning several transitive reduction problems on network that have applications in network synthesis and analysis involving cellular processes. Our starting point will be the so-called minimum equivalent digraph problem, a classic computational problem in combinatorial algorithms. We will subsequently consider a few non-trivial extensions or generalizations of this problem motivated by applications in systems biology. We will then discuss the applications of these algorithmic methodologies in the context of three major biological research questions: synthesizing and simplifying signal transduction networks, analyzing disease networks, and measuring redundancy of biological networks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑