Vilela Marco, Chou I-Chun, Vinga Susana, Vasconcelos Ana Tereza R, Voit Eberhard O, Almeida Jonas S
Dept. Bioinformatics and Computational Biology, University of Texas M,D, Anderson Cancer Center, 1515 Holcombe Blvd, Houston, TX 77030, USA.
BMC Syst Biol. 2008 Apr 16;2:35. doi: 10.1186/1752-0509-2-35.
The inverse problem of identifying the topology of biological networks from their time series responses is a cornerstone challenge in systems biology. We tackle this challenge here through the parameterization of S-system models. It was previously shown that parameter identification can be performed as an optimization based on the decoupling of the differential S-system equations, which results in a set of algebraic equations.
A novel parameterization solution is proposed for the identification of S-system models from time series when no information about the network topology is known. The method is based on eigenvector optimization of a matrix formed from multiple regression equations of the linearized decoupled S-system. Furthermore, the algorithm is extended to the optimization of network topologies with constraints on metabolites and fluxes. These constraints rejoin the system in cases where it had been fragmented by decoupling. We demonstrate with synthetic time series why the algorithm can be expected to converge in most cases.
A procedure was developed that facilitates automated reverse engineering tasks for biological networks using S-systems. The proposed method of eigenvector optimization constitutes an advancement over S-system parameter identification from time series using a recent method called Alternating Regression. The proposed method overcomes convergence issues encountered in alternate regression by identifying nonlinear constraints that restrict the search space to computationally feasible solutions. Because the parameter identification is still performed for each metabolite separately, the modularity and linear time characteristics of the alternating regression method are preserved. Simulation studies illustrate how the proposed algorithm identifies the correct network topology out of a collection of models which all fit the dynamical time series essentially equally well.
从生物网络的时间序列响应中识别其拓扑结构的逆问题是系统生物学中的一项核心挑战。我们在此通过S-系统模型的参数化来应对这一挑战。此前已表明,参数识别可作为基于微分S-系统方程解耦的优化来进行,这会产生一组代数方程。
提出了一种新颖的参数化解决方案,用于在不知道网络拓扑信息的情况下从时间序列中识别S-系统模型。该方法基于由线性化解耦S-系统的多元回归方程形成的矩阵的特征向量优化。此外,该算法扩展到了对代谢物和通量有约束的网络拓扑优化。这些约束在系统因解耦而碎片化的情况下重新连接系统。我们用合成时间序列证明了为什么该算法在大多数情况下有望收敛。
开发了一种程序,便于使用S-系统对生物网络进行自动化逆向工程任务。所提出的特征向量优化方法相对于使用一种称为交替回归的最新方法从时间序列进行S-系统参数识别有了改进。所提出的方法通过识别将搜索空间限制为计算上可行解的非线性约束,克服了交替回归中遇到的收敛问题。由于参数识别仍分别针对每个代谢物进行,因此保留了交替回归方法的模块化和线性时间特性。模拟研究说明了所提出的算法如何从一组都基本同样好地拟合动态时间序列的模型中识别出正确的网络拓扑。