On an algorithmic definition for the components of the minimal cell

Living cells are highly complex systems comprising a multitude of elements that are engaged in the many convoluted processes observed during the cell cycle. However, not all elements and processes are essential for cell survival and reproduction under steady-state environmental conditions. To distinguish between essential from expendable cell components and thus define the ‘minimal cell’ and the corresponding ‘minimal genome’, we postulate that the synthesis of all cell elements can be represented as a finite set of binary operators, and within this framework we show that cell elements that depend on their previous existence to be synthesized are those that are essential for cell survival. An algorithm to distinguish essential cell elements is presented and demonstrated within an interactome. Data and functions implementing the algorithm are given as supporting information. We expect that this algorithmic approach will lead to the determination of the complete interactome of the minimal cell, which could then be experimentally validated. The assumptions behind this hypothesis as well as its consequences for experimental and theoretical biology are discussed.

活细胞是高度复杂的系统，由大量组分构成，这些组分参与细胞周期中观测到的诸多繁复过程。然而在稳态环境条件下，并非所有组分与过程都对细胞存活与增殖不可或缺。为区分细胞必需组分与非必需组分，进而定义“最小细胞”及其对应的“最小基因组”，我们提出假说：所有细胞组分的合成都可被表征为一组有限的二元算子；在此框架下，我们证明，依赖自身先前存在才能完成合成的细胞组分，正是细胞存活所必需的组分。本文提出一种区分细胞必需组分的算法，并在交互组（interactome）中对其进行验证演示。实现该算法的相关数据与函数已作为支持性材料提供。我们预期，该算法方法将助力确定最小细胞的完整交互组，后续可通过实验对其进行验证。本文还讨论了该假说背后的各项假设，以及其对实验生物学与理论生物学的启示。