Condon Anne, Kirkpatrick Bonnie, Maňuch Ján
Department of Computer Science, University of British Columbia, Vancouver, Canada.
Intrepid Net Computing, Dillon, MT USA.
Nat Comput. 2017;16(2):261-284. doi: 10.1007/s11047-016-9587-9. Epub 2017 Jan 3.
A major goal of natural computing is to design biomolecules, such as nucleic acid sequences, that can be used to perform computations. We design sequences of nucleic acids that are "guaranteed" to have long folding pathways relative to their length. This particular sequences with high probability follow low-barrier folding pathways that visit a large number of distinct structures. Long folding pathways are interesting, because they demonstrate that natural computing can potentially support long and complex computations. Formally, we provide the first scalable designs of molecules whose low-barrier folding pathways, with respect to a simple, stacked pair energy model, grow superlinearly with the molecule length, but for which all significantly shorter alternative folding pathways have an energy barrier that is [Formula: see text] times that of the low-barrier pathway for any [Formula: see text] and a sufficiently long sequence.
自然计算的一个主要目标是设计可用于执行计算的生物分子,如核酸序列。我们设计的核酸序列“保证”相对于其长度具有长折叠路径。这种特定序列很可能遵循低势垒折叠路径,访问大量不同结构。长折叠路径很有趣,因为它们表明自然计算可能支持长而复杂的计算。正式地说,我们提供了分子的首个可扩展设计,对于一个简单的堆叠对能量模型,其低势垒折叠路径随分子长度超线性增长,但对于任何[公式:见原文]和足够长的序列,所有明显更短的替代折叠路径的能量势垒是低势垒路径的[公式:见原文]倍。