Technical notes and correspondence
Technical notes and correspondence
复制标题
DOI：
10.1109/tac.2008.928114
复制
发表时间：
2008-08-01
影响因子：
6.8
通讯作者：
Warnick, Sean
中科院分区：
文献类型：
--
作者：
Goncalves, Jorge;Warnick, Sean
本文提出并解决了线性定常系统的网络重构问题。这个问题的动机来自不同的学科，但它最近得到了相当大的关注，从系统生物学社区在化学反应网络的研究。在这里，我们证明，即使传递函数可以从输入输出数据中完全识别，布尔重建也是不可能的，一般来说，没有更多的系统信息。然后，我们完全描述这个额外的信息，是必不可少的动态重建，而不呼吁特设假设的网络，如稀疏性或极小。
This paper formulates and solves the network reconstruction problem for linear time-invariant systems. The problem is motivated from a variety of disciplines, but it has recently received considerable attention from the systems biology community in the study of chemical reaction networks. Here, we demonstrate that even when a transfer function can be identified perfectly from input-output data, not even Boolean reconstruction is possible, in general, without more information about the system. We then completely characterize this additional information that is essential for dynamical reconstruction without appeal to ad-hoc assumptions about the network, such as sparsity or minimality.