In this web server, we approximately solve the RNA inverse folding problems appear in various contexts by using multi-objective genetic algorithm, MODENA (ver.0084); we obtain the approximate set of Pareto optimal solutions, i.e. the set of RNA sequences which are not dominated by any other RNA sequence, where solution A is dominated by solution B if all objective functions (OFs) of solution A are better than or equal to those of solution B and at least one OF value of A is not equal to that of B. The advantage of this approach is that, without empirical weight parameters, we can explore vast sequence space to obtain desirable RNA sequences that optimize multiple OFs. For the detail of the multi-objective genetic algorithm, please see the following paper:
Akito Taneda, Multi-objective optimization for RNA design with multiple target secondary structures, BMC Bioinformatics 16:280 (2015).
The research on development of this web server was partially supported by JSPS KAKENHI Grant Number 15K00392 and 18K11519.
The details of this web server are described in the following paper:
Akito Taneda and Kengo Sato,
A Web Server for Designing Molecular Switches Composed of Two Interacting RNAs,
International Journal of Molecular Informatics 22, 272 (2021).