Abstract

BackgroundAutocatalytic sets are considered to be fundamental to the origin of life. Prior theoretical and computational work on the existence and properties of these sets has relied on a fast algorithm for detectingself-sustaining autocatalytic sets in chemical reaction systems. Here, we introduce and apply a modified version and several extensions of the basic algorithm: (i) a modification aimed at reducing the number of calls to the computationally most expensive part of the algorithm, (ii) the application of a previously introduced extension of the basic algorithm to sample the smallest possible autocatalytic sets within a reaction network, and the application of a statistical test which provides a probable lower bound on the number of such smallest sets, (iii) the introduction and application of another extension of the basic algorithm to detect autocatalytic sets in a reaction system where molecules can also inhibit (as well as catalyse) reactions, (iv) a further, more abstract, extension of the theory behind searching for autocatalytic sets.Results(i) The modified algorithm outperforms the original one in the number of calls to the computationally most expensive procedure, which, in some cases also leads to a significant improvement in overall running time, (ii) our statistical test provides strong support for the existence of very large numbers (even millions) of minimal autocatalytic sets in a well-studied polymer model, where these minimal sets share about half of their reactions on average, (iii) “uninhibited” autocatalytic sets can be found in reaction systems that allow inhibition, but their number and sizes depend on the level of inhibition relative to the level of catalysis.Conclusions(i) Improvements in the overall running time when searching for autocatalytic sets can potentially be obtained by using a modified version of the algorithm, (ii) the existence of large numbers of minimal autocatalytic sets can have important consequences for the possible evolvability of autocatalytic sets, (iii) inhibition can be efficiently dealt with as long as the total number of inhibitors is small.

Highlights

  • Autocatalytic sets are considered to be fundamental to the origin of life

  • A more formal definition of RAF sets is provided in [9,11], including an efficient algorithm for finding such sets in any chemical reaction system (CRS). This RAF algorithm returns the union of all RAFsets that exist within a given CRS, or the empty set if the CRS does not contain any RAF set

  • Since we do not know of an efficient algorithm to count the number of irreducible RAF (irrRAF), we introduce a statistical test that provides a probable lower bound on the number of irrRAFs that can be expected to exist in any given RAF set

Read more

Summary

Introduction

Autocatalytic sets are considered to be fundamental to the origin of life. Prior theoretical and computational work on the existence and properties of these sets has relied on a fast algorithm for detecting self-sustaining autocatalytic sets in chemical reaction systems. The algorithm terminates on the first value of k for which f (Rk) = Rk. This terminal set of reactions Rk is an RAF by definition and, by the above, we have Rm ⊆ Rk. since Rm is the maxRAF, we must have Rm = Rk, as required.

Results
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call