{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T00:46:07Z","timestamp":1740185167300,"version":"3.37.3"},"reference-count":21,"publisher":"Oxford University Press (OUP)","issue":"Supplement_1","license":[{"start":{"date-parts":[[2020,7,13]],"date-time":"2020-07-13T00:00:00Z","timestamp":1594598400000},"content-version":"vor","delay-in-days":12,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001700","name":"MEXT","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"JSPS","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"KAKENHI","doi-asserted-by":"crossref","award":["JP16H02484","JP16H06279","JP16K16143"],"award-info":[{"award-number":["JP16H02484","JP16H06279","JP16K16143"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"crossref"}]},{"name":"JST CREST","award":["JPMJCR18S1"],"award-info":[{"award-number":["JPMJCR18S1"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,7,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:sec>\n                  <jats:title>Motivation<\/jats:title>\n                  <jats:p>RNA folding kinetics plays an important role in the biological functions of RNA molecules. An important goal in the investigation of the kinetic behavior of RNAs is to find the folding pathway with the lowest energy barrier. For this purpose, most of the existing methods use heuristics because the number of possible pathways is huge even if only the shortest (direct) folding pathways are considered.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Results<\/jats:title>\n                  <jats:p>In this study, we propose a new method using a best-first search strategy to efficiently compute the exact solution of the minimum barrier energy of direct pathways. Using our method, we can find the exact direct pathways within a Hamming distance of 20, whereas the previous methods even miss the exact short pathways. Moreover, our method can be used to improve the pathways found by existing methods for exploring indirect pathways.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Availability and implementation<\/jats:title>\n                  <jats:p>The source code and datasets created and used in this research are available at https:\/\/github.com\/eukaryo\/czno.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Supplementary information<\/jats:title>\n                  <jats:p>Supplementary data are available at Bioinformatics online.<\/jats:p>\n               <\/jats:sec>","DOI":"10.1093\/bioinformatics\/btaa469","type":"journal-article","created":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T12:13:01Z","timestamp":1588594381000},"page":"i227-i235","source":"Crossref","is-referenced-by-count":1,"title":["Finding the direct optimal RNA barrier energy and improving pathways with an arbitrary energy model"],"prefix":"10.1093","volume":"36","author":[{"given":"Hiroki","family":"Takizawa","sequence":"first","affiliation":[{"name":"Graduate School of Frontier Sciences, University of Tokyo Department of Computational Biology and Medical Sciences, , Tokyo, Chiba 277-8561 Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junichi","family":"Iwakiri","sequence":"additional","affiliation":[{"name":"Graduate School of Frontier Sciences, University of Tokyo Department of Computational Biology and Medical Sciences, , Tokyo, Chiba 277-8561 Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Goro","family":"Terai","sequence":"additional","affiliation":[{"name":"Graduate School of Frontier Sciences, University of Tokyo Department of Computational Biology and Medical Sciences, , Tokyo, Chiba 277-8561 Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kiyoshi","family":"Asai","sequence":"additional","affiliation":[{"name":"Graduate School of Frontier Sciences, University of Tokyo Department of Computational Biology and Medical Sciences, , Tokyo, Chiba 277-8561 Japan"},{"name":"Artificial Intelligence Research Center (AIRC), National Institute of Advanced Science and Technology (AIST) , Tokyo135-0064, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2020,7,13]]},"reference":[{"key":"2024021913324775300_btaa469-B1","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1073\/pnas.97.2.646","article-title":"RNA folding energy landscapes","volume":"97","author":"Chen","year":"2000","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"2024021913324775300_btaa469-B2","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connexion with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math"},{"key":"2024021913324775300_btaa469-B3","doi-asserted-by":"crossref","first-page":"7280","DOI":"10.1093\/nar\/gkg938","article-title":"A statistical sampling algorithm for RNA secondary structure prediction","volume":"31","author":"Ding","year":"2003","journal-title":"Nucleic Acids Res"},{"key":"2024021913324775300_btaa469-B4","doi-asserted-by":"crossref","first-page":"1711","DOI":"10.1093\/nar\/gkp1054","article-title":"Computing folding pathways between RNA secondary structures","volume":"38","author":"Dotu","year":"2010","journal-title":"Nucleic Acids Res"},{"key":"2024021913324775300_btaa469-B5","doi-asserted-by":"crossref","first-page":"5708","DOI":"10.1093\/nar\/gkv480","article-title":"An implementation of the Gillespie algorithm for RNA kinetics with logarithmic time update","volume":"43","author":"Dykeman","year":"2015","journal-title":"Nucleic Acids Res"},{"key":"2024021913324775300_btaa469-B6","doi-asserted-by":"crossref","first-page":"7016","DOI":"10.1021\/jacs.6b01453","article-title":"Translation initiation is controlled by RNA folding kinetics via a ribosome drafting mechanism","volume":"138","author":"Espah Borujeni","year":"2016","journal-title":"J. Am. Chem. Soc"},{"key":"2024021913324775300_btaa469-B7","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1017\/S1355838201000863","article-title":"Design of multistable RNA molecules","volume":"7","author":"Flamm","year":"2001","journal-title":"RNA (New York, N.Y.)"},{"key":"2024021913324775300_btaa469-B8","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1524\/zpch.2002.216.2.155","article-title":"Barrier trees of degenerate landscapes","volume":"216","author":"Flamm","year":"2002","journal-title":"Zeitschrift F\u00fcr Physikalische Chemie"},{"key":"2024021913324775300_btaa469-B9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1146\/annurev.genet.31.1.1","article-title":"Antisense RNA-regulated programmed cell death","volume":"31","author":"Gerdes","year":"1997","journal-title":"Annu. Rev. Genet"},{"year":"2012","author":"Graves","key":"2024021913324775300_btaa469-B10"},{"key":"2024021913324775300_btaa469-B11","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"A formal basis for the heuristic determination of minimum cost paths","volume":"4","author":"Hart","year":"1968","journal-title":"IEEE Trans. Syst. Sci. Cybern"},{"key":"2024021913324775300_btaa469-B12","doi-asserted-by":"crossref","DOI":"10.1186\/1471-2105-13-S3-S5","article-title":"Predicting folding pathways between RNA conformational structures guided by RNA stacks","volume":"13","author":"Li","year":"2012","journal-title":"BMC Bioinformatics"},{"first-page":"11","year":"2009","author":"Lorenz","key":"2024021913324775300_btaa469-B13"},{"key":"2024021913324775300_btaa469-B14","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1186\/1748-7188-6-26","article-title":"ViennaRNA package 2.0","volume":"6","author":"Lorenz","year":"2011","journal-title":"Algorithms Mol. Biol"},{"key":"2024021913324775300_btaa469-B15","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s11047-010-9239-4","article-title":"NP-completeness of the energy barrier problem without pseudoknots and temporary arcs","volume":"10","author":"Ma\u0148uch","year":"2011","journal-title":"Nat. Comput"},{"key":"2024021913324775300_btaa469-B16","first-page":"321","article-title":"Semiring frameworks and algorithms for shortest-distance problems","volume":"7","author":"Mohri","year":"2002","journal-title":"J. Automata Lang. Comb"},{"key":"2024021913324775300_btaa469-B17","doi-asserted-by":"crossref","first-page":"3153","DOI":"10.1088\/0305-4470\/31\/14\/005","article-title":"Barrier heights between ground states in a model of RNA secondary structure","volume":"31","author":"Morgan","year":"1998","journal-title":"J. Phys. A Math. Gen"},{"key":"2024021913324775300_btaa469-B18","doi-asserted-by":"crossref","first-page":"1408","DOI":"10.1017\/S1355838299990805","article-title":"Metastable structures and refolding kinetics in hok mRNA of plasmid R1","volume":"5","author":"Nagel","year":"1999","journal-title":"RNA"},{"first-page":"108","year":"2010","author":"Thachuk","key":"2024021913324775300_btaa469-B19"},{"key":"2024021913324775300_btaa469-B20","doi-asserted-by":"crossref","first-page":"1573","DOI":"10.1093\/bioinformatics\/bth129","article-title":"Evaluating the predictability of conformational switching in RNA","volume":"20","author":"Voss","year":"2004","journal-title":"Bioinformatics"},{"key":"2024021913324775300_btaa469-B21","doi-asserted-by":"crossref","first-page":"4731","DOI":"10.1088\/0305-4470\/37\/17\/005","article-title":"Efficient computation of RNA folding dynamics","volume":"37","author":"Wolfinger","year":"2004","journal-title":"J. Phys. A Math. Gen"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/36\/Supplement_1\/i227\/56702651\/bioinformatics_36_supplement1_i227.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/36\/Supplement_1\/i227\/56702651\/bioinformatics_36_supplement1_i227.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T13:38:40Z","timestamp":1708349920000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/36\/Supplement_1\/i227\/5870508"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,1]]},"references-count":21,"journal-issue":{"issue":"Supplement_1","published-print":{"date-parts":[[2020,7,1]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btaa469","relation":{},"ISSN":["1367-4803","1367-4811"],"issn-type":[{"type":"print","value":"1367-4803"},{"type":"electronic","value":"1367-4811"}],"subject":[],"published-other":{"date-parts":[[2020,7]]},"published":{"date-parts":[[2020,7,1]]}}}