Skip to main content
SpringerLink
Log in

Monte Carlo Inverse Folding

  • Conference paper
  • First Online:
Monte Carlo Search (MCS 2020)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1379))

Included in the following conference series:

Abstract

The RNA Inverse Folding problem comes from computational biology. The goal is to find a molecule that has a given folding. It is important for scientific fields such as bioengineering, pharmaceutical research, biochemistry, synthetic biology and RNA nanostructures. Nested Monte Carlo Search has given excellent results for this problem. We propose to adapt and evaluate different Monte Carlo Search algorithms for the RNA Inverse Folding problem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Bonnet, É., Rzążewski, P., Sikora, F.: Designing RNA secondary structures is hard. J. Comput. Biol. 27(3), 302–316 (2020)

    Article  MathSciNet  Google Scholar 

  2. Bouzy, B.: Monte-Carlo fork search for cooperative path-finding. In: Cazenave, T., Winands, M.H.M., Iida, H. (eds.) CGW 2013. CCIS, vol. 408, pp. 1–15. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-05428-5_1

    Chapter  Google Scholar 

  3. Bouzy, B.: Burnt pancake problem: new lower bounds on the diameter and new experimental optimality ratios. In: Proceedings of the Ninth Annual Symposium on Combinatorial Search, SOCS 2016, Tarrytown, NY, USA, 6–8 July 2016, pp. 119–120 (2016)

    Google Scholar 

  4. Browne, C., et al.: A survey of Monte Carlo tree search methods. IEEE Trans. Comput. Intell. AI Games 4(1), 1–43 (2012). https://doi.org/10.1109/TCIAIG.2012.2186810

    Article  Google Scholar 

  5. Cazenave, T.: Nested Monte-Carlo search. In: Boutilier, C. (ed.) IJCAI, pp. 456–461 (2009)

    Google Scholar 

  6. Cazenave, T.: Monte Carlo beam search. IEEE Trans. Comput. Intell. AI Games 4(1), 68–72 (2012)

    Article  Google Scholar 

  7. Cazenave, T.: Monte-Carlo expression discovery. Int. J. Artif. Intell. Tools 22(1), 1250035 (2013)

    Article  Google Scholar 

  8. Cazenave, T.: Nested rollout policy adaptation with selective policies. In: Cazenave, T., Winands, M.H.M., Edelkamp, S., Schiffel, S., Thielscher, M., Togelius, J. (eds.) CGW/GIGA -2016. CCIS, vol. 705, pp. 44–56. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-57969-6_4

    Chapter  Google Scholar 

  9. Cazenave, T.: Playout policy adaptation with move features. Theoret. Comput. Sci. 644, 43–52 (2016)

    Article  MathSciNet  Google Scholar 

  10. Cazenave, T.: Generalized nested rollout policy adaptation. In: Monte Search at IJCAI (2020)

    Google Scholar 

  11. Cazenave, T., Jouandeau, N.: On the parallelization of UCT. In: Computer Games Workshop, Amsterdam, Netherlands (2007). https://hal.archives-ouvertes.fr/hal-02310186

  12. Cazenave, T., Lucas, J.Y., Kim, H., Triboulet, T.: Monte Carlo vehicle routing. In: ATT at ECAI (2020)

    Google Scholar 

  13. Cazenave, T., Sevestre, J.B., Toulemont, M.: Stabilized nested rollout policy adaptation. In: Monte Search at IJCAI (2020)

    Google Scholar 

  14. Cazenave, T., Teytaud, F.: Application of the nested rollout policy adaptation algorithm to the traveling salesman problem with time windows. In: Hamadi, Y., Schoenauer, M. (eds.) LION 2012. LNCS, pp. 42–54. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-34413-8_4

    Chapter  Google Scholar 

  15. Cazenave, T., Teytaud, F.: Beam nested rollout policy adaptation. In: Computer Games Workshop, ECAI 2012, pp. 1–12 (2012)

    Google Scholar 

  16. Chaslot, G.M.J.-B., Winands, M.H.M., van den Herik, H.J.: Parallel Monte-Carlo tree search. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. LNCS, vol. 5131, pp. 60–71. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-87608-3_6

    Chapter  Google Scholar 

  17. Coulom, R.: Efficient selectivity and backup operators in Monte-Carlo tree search. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M.J. (eds.) CG 2006. LNCS, vol. 4630, pp. 72–83. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-75538-8_7

    Chapter  Google Scholar 

  18. Edelkamp, S., Cazenave, T.: Improved diversity in nested rollout policy adaptation. In: Friedrich, G., Helmert, M., Wotawa, F. (eds.) KI 2016. LNCS (LNAI), vol. 9904, pp. 43–55. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-46073-4_4

    Chapter  Google Scholar 

  19. Edelkamp, S., Gath, M., Cazenave, T., Teytaud, F.: Algorithm and knowledge engineering for the TSPTW problem. In: 2013 IEEE Symposium on omputational Intelligence in Scheduling (SCIS), pp. 44–51. IEEE (2013)

    Google Scholar 

  20. Edelkamp, S., Gath, M., Greulich, C., Humann, M., Herzog, O., Lawo, M.: Monte-Carlo tree search for logistics. In: Clausen, U., Friedrich, H., Thaller, C., Geiger, C. (eds.) Commercial Transport. LNL, pp. 427–440. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-21266-1_28

    Chapter  Google Scholar 

  21. Edelkamp, S., Gath, M., Rohde, M.: Monte-Carlo tree search for 3D packing with object orientation. In: Lutz, C., Thielscher, M. (eds.) KI 2014. LNCS (LNAI), vol. 8736, pp. 285–296. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-11206-0_28

    Chapter  Google Scholar 

  22. Edelkamp, S., Greulich, C.: Solving physical traveling salesman problems with policy adaptation. In: 2014 IEEE Conference on Computational Intelligence and Games (CIG), pp. 1–8. IEEE (2014)

    Google Scholar 

  23. Edelkamp, S., Tang, Z.: Monte-Carlo tree search for the multiple sequence alignment problem. In: Eighth Annual Symposium on Combinatorial Search (2015)

    Google Scholar 

  24. Kinny, D.: A new approach to the snake-in-the-box problem. In: ECAI, vol. 242, pp. 462–467 (2012)

    Google Scholar 

  25. Kocsis, L., Szepesvári, C.: Bandit based Monte-Carlo planning. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 282–293. Springer, Heidelberg (2006). https://doi.org/10.1007/11871842_29

    Chapter  Google Scholar 

  26. Méhat, J., Cazenave, T.: Combining UCT and nested Monte Carlo search for single-player general game playing. IEEE Trans. Comput. Intell. AI Games 2(4), 271–277 (2010)

    Article  Google Scholar 

  27. Nagorko, A.: Parallel nested rollout policy adaptation. In: IEEE Conference on Games (2019)

    Google Scholar 

  28. Negrevergne, B., Cazenave, T.: Distributed nested rollout policy for SameGame. In: Cazenave, T., Winands, M.H.M., Saffidine, A. (eds.) CGW 2017. CCIS, vol. 818, pp. 108–120. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-75931-9_8

    Chapter  Google Scholar 

  29. Portela, F.: An unexpectedly effective Monte Carlo technique for the RNA inverse folding problem. BioRxiv, p. 345587 (2018)

    Google Scholar 

  30. Poulding, S.M., Feldt, R.: Generating structured test data with specific properties using nested Monte-Carlo search. In: Genetic and Evolutionary Computation Conference, GECCO 2014, Vancouver, BC, Canada, 12–16 July 2014, pp. 1279–1286 (2014)

    Google Scholar 

  31. Poulding, S.M., Feldt, R.: Heuristic model checking using a Monte-Carlo tree search algorithm. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2015, Madrid, Spain, 11–15 July 2015, pp. 1359–1366 (2015)

    Google Scholar 

  32. Rimmel, A., Teytaud, F., Cazenave, T.: Optimization of the nested Monte-Carlo algorithm on the traveling salesman problem with time windows. In: Di Chio, C., et al. (eds.) EvoApplications 2011. LNCS, vol. 6625, pp. 501–510. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-20520-0_51

    Chapter  Google Scholar 

  33. Rosin, C.D.: Nested rollout policy adaptation for Monte Carlo Tree Search. In: IJCAI, pp. 649–654 (2011)

    Google Scholar 

Download references

Acknowledgment

Thanks to Fernando Portela for his NEMO program. This work was supported in part by the French government under management of Agence Nationale de la Recherche as part of the “Investissements d’avenir” program, reference ANR19-P3IA-0001 (PRAIRIE 3IA Institute).

Author information

Authors and Affiliations

  1. LAMSADE, Université Paris-Dauphine, PSL, CNRS, Paris, France

    Tristan Cazenave & Thomas Fournier

Authors
  1. Tristan Cazenave
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Fournier
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tristan Cazenave .

Editor information

Editors and Affiliations

  1. Université Paris-Dauphine, Paris, France

    Tristan Cazenave

  2. Facebook FAIR, Paris, France

    Olivier Teytaud

  3. Maastricht University, Maastricht, Limburg, The Netherlands

    Mark H. M. Winands

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Cazenave, T., Fournier, T. (2021). Monte Carlo Inverse Folding. In: Cazenave, T., Teytaud, O., Winands, M.H.M. (eds) Monte Carlo Search. MCS 2020. Communications in Computer and Information Science, vol 1379. Springer, Cham. https://doi.org/10.1007/978-3-030-89453-5_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-89453-5_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-89452-8

  • Online ISBN: 978-3-030-89453-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation