.png){kind=icon}
Return
Technical notes and correspondence
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2008.928114.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
network reconstruction
networked systems
systems biology
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W
Organization
Cited Papers
Topological and causal structure of the yeast transcriptional regulatory network.png)
NATURE GENETICS
OAAI
NATURE GENETICSIF31.8
OAAIShareSave
Impact of Hydrogen Bonding in the Binding Site between Capsid Protein and MS2 Bacteriophage ssRNA
PREAI
ShareSaveUntangling the wires: A strategy to trace functional interactions in signaling and gene networksOAAI
OAAIShareSaveShareSave
View more