Abstract

Evolutionary computations is an impressive example of the convergence of two research fields: evolutionary biology and computer sciences. While initially genetic algorithms (GAs) were inspired by the ideas of the theory of evolution in biology, there is now a tendency toward the reverse transfer of ideas to a biological experiment. An example of such a transfer is the directed evolution of macromolecules that can be considered as an analogue of GAs in biochemical experiments. We focus on the concept of building blocks (BB) that underlies the theoretical and practical effectiveness of GA in evolutionary search. In in vitro experiments the modular structure of macromolecules points to the parallels between domains/motifs and BBs. In computer science there were developed a great number of algorithms for finding and preserving BBs. It was proved that such procedures provide the effectiveness of the evolutionary search. In this work we show how significantly some heuristic algorithms preserving the BBs can increase the efficiency of the in vitro evolution. As a benchmark test, we use such an actual problem of synthetic biology as the evolutionary search for multi-domain RNA devices. The results of these tests with simple heuristic algorithms are very promising with the prospective of further implementation of more advanced GA procedures in the evolutionary experiments in vitro. In conclusion, we discuss the importance of such highly efficient heuristic algorithms for the evolutionary and synthetic biology.

Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.