Egri-Nagy Attila, Nehaniv Chrystopher L
School of Computer Science, University of Hertfordshire, Hatfield, Hertfordshire, United Kingdom.
Artif Life. 2008 Summer;14(3):299-312. doi: 10.1162/artl.2008.14.3.14305.
Beyond complexity measures, sometimes it is worthwhile in addition to investigate how complexity changes structurally, especially in artificial systems where we have complete knowledge about the evolutionary process. Hierarchical decomposition is a useful way of assessing structural complexity changes of organisms modeled as automata, and we show how recently developed computational tools can be used for this purpose, by computing holonomy decompositions and holonomy complexity. To gain insight into the evolution of complexity, we investigate the smoothness of the landscape structure of complexity under minimal transitions. As a proof of concept, we illustrate how the hierarchical complexity analysis reveals symmetries and irreversible structure in biological networks by applying the methods to the lac operon mechanism in the genetic regulatory network of Escherichia coli.
除了复杂性度量之外,有时还值得进一步研究复杂性在结构上是如何变化的,特别是在我们对进化过程有完整了解的人工系统中。层次分解是评估作为自动机建模的生物体结构复杂性变化的一种有用方法,我们展示了如何通过计算完整度分解和完整度复杂性,将最近开发的计算工具用于此目的。为了深入了解复杂性的演变,我们研究了在最小转变下复杂性景观结构的平滑性。作为概念验证,我们通过将这些方法应用于大肠杆菌遗传调控网络中的乳糖操纵子机制,来说明层次复杂性分析如何揭示生物网络中的对称性和不可逆结构。