论文标题
统一的逆向工程和数据选择的方法，用于独特的网络标识
A unified approach to reverse engineering and data selection for unique network identification
论文作者
论文摘要
由于成本问题，最佳选择使用尽可能少的实验深入了解生物和其他网络的连通性。自近二十年来引入逆向工程的代数方法以来，唯一网络连接识别的数据选择一直是一个空旷的问题。在本手稿中，我们确定哪些数据集唯一地识别与时间和空间离散系统相对应的未签名接线图。此外，我们回答了布尔网络签名的接线图的唯一性问题。在计算上，已经分别研究了未签名和签名的接线图，在本手稿中，我们还表明存在一个理想的能够编码无签名和签名信息的理想。这为研究逆向工程提供了一种统一的方法，该方法也带来了重大的计算益处。
Due to cost concerns, it is optimal to gain insight into the connectivity of biological and other networks using as few experiments as possible. Data selection for unique network connectivity identification has been an open problem since the introduction of algebraic methods for reverse engineering for almost two decades. In this manuscript we determine what data sets uniquely identify the unsigned wiring diagram corresponding to a system that is discrete in time and space. Furthermore, we answer the question of uniqueness for signed wiring diagrams for Boolean networks. Computationally, unsigned and signed wiring diagrams have been studied separately, and in this manuscript we also show that there exists an ideal capable of encoding both unsigned and signed information. This provides a unified approach to studying reverse engineering that also gives significant computational benefits.
