RNA folding using quantum computers
Open accessPublished version of a preprint
The DOI matches its Crossref record; 60 of the 65 references it cites were found in a registry or an index.
Abstract
The 3-dimensional fold of an RNA molecule is largely determined by patterns of intramolecular hydrogen bonds between bases. Predicting the base pairing network from the sequence, also referred to as RNA secondary structure prediction or RNA folding, is a nondeterministic polynomial-time (NP)-complete computational problem. The structure of the molecule is strongly predictive of its functions and biochemical properties, and therefore the ability to accurately predict the structure is a crucial tool for biochemists. Many methods have been proposed to efficiently sample possible secondary structure patterns. Classic approaches employ dynamic programming, and recent studies have explored approaches inspired by evolutionary and machine learning algorithms. This work demonstrates leveraging quantum computing hardware to predict the secondary structure of RNA. A Hamiltonian written in the form of a Binary Quadratic Model (BQM) is derived to drive the system toward maximizing the number of consecutive base pairs while jointly maximizing the average length of the stems. A Quantum Annealer (QA) is compared to a Replica Exchange Monte Carlo (REMC) algorithm programmed with the same objective function, with the QA being shown to be highly competitive at rapidly identifying low energy solutions. The method proposed in this study was compared to three algorithms from literature and, despite its simplicity, was found to be competitive on a test set containing known structures with pseudoknots.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Figures




Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“Recently, Fox and his colleagues have shown that the RNA secondary structure prediction issue can be solved as Binary Quadratic Model, which can be addressed using quantum computing [86].”
From Quantum Computing in the Next-Generation Computational Biology Landscape: From Protein Folding to Molecular Dynamics (2024) · cites this paper as [86]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Harris, C. R., Millman, K. J., van der Walt, S. J., Gommers, R., Virtanen, P., Cournapeau, D., Wieser, E., Taylor, J., Berg, S., Smith, N. J., et al. (2020) · Nature · doi:10.1038/s41586-020-2649-2 · Cited by 23,826 · cited 3×
“The REMC method was implemented in pure Python and takes advantage of NumPy (44), and Python’s Random and Copy libraries.”
MethodInfluentialHarris, C., Millman, K., van der Walt, S., Gommers, R., Virtanen, P., Cournapeau, D., Wieser, E., Taylor, J., Berg, S., Smith, N., et al. (2020) · RePEc: Research Papers in Economics · Cited by 17,844
Monte Carlo sampling methods using Markov chains and their applications.
Hastings, W. K. (1970) · Biometrika · doi:10.1093/biomet/57.1.97 · Cited by 15,195 · cited 2×
“In each case, if the move improves the objective function, the state is accepted, otherwise the state is accepted subject to the Metropolis-Hastings criteria [51] with a probability proportional to the Boltzmann distribution at a particular temperature.”
BackgroundMethodQuantum supremacy using a programmable superconducting processor
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., et al. (2019) · Nature · doi:10.1038/s41586-019-1666-5 · Cited by 7,720 · cited 1×
“To date state-of-the-art quantum devices are able to outperform classical computers in a narrow range of tasks (25,26), however, there have not yet been any concrete demonstrations of quantum advantage for commercial applications primarily due to the fact that QCs are limited in size and capabilities (27).”
BackgroundU1 snRNP regulates cancer cell migration and invasion in vitro
Oh, J.-M., Venters, C. C., Di, C., Pinto, A. M., Wan, L., Younis, I., Cai, Z., Arai, C., So, B. R., Duan, J., et al. (2020) · Nature Communications · doi:10.1038/s41467-019-13993-7 · Cited by 7,157
Lorenz, R., Bernhart, S. H., Höner zu Siederdissen, C., Tafer, H., Flamm, C., Stadler, P. F., & Hofacker, I. L. (2011) · Algorithms for Molecular Biology · doi:10.1186/1748-7188-6-26 · Cited by 5,098 · cited 6×
“Two of the methods, SPOT-RNA [11] and ProbKnot [41], are capable of predicting pseudoknots while the other method, ViennaRNA [42], is not.”
MethodInfluentialOptimal computer folding of large RNA sequences using thermodynamics and auxiliary information
Zuker, M., & Stiegler, P. (1981) · Nucleic Acids Research · doi:10.1093/nar/9.1.133 · Cited by 3,562 · cited 1×
“Classic approaches to sampling RNA secondary structure configurations utilize dynamic programming [9,20,21], while more recent methods have employed simulated annealing and Monte Carlo methods [22–24].”
MethodImproved protein structure prediction using potentials from deep learning
Senior, A. W., Evans, R., Jumper, J., Kirkpatrick, J., Sifre, L., Green, T., Qin, C., Žídek, A., Nelson, A. W. R., Bridgland, A., et al. (2020) · Nature · doi:10.1038/s41586-019-1923-7 · Cited by 3,378
Exchange Monte Carlo Method and Application to Spin Glass Simulations
Hukushima, K., & Nemoto, K. (1996) · Journal of the Physical Society of Japan · doi:10.1143/jpsj.65.1604 · Cited by 2,475
Quantum computational advantage using photons
Zhong, H.-S., Wang, H., Deng, Y.-H., Chen, M.-C., Peng, L.-C., Luo, Y.-H., Qin, J., Wu, D., Ding, X., Hu, Y., et al. (2020) · Science · doi:10.1126/science.abe8770 · Cited by 2,405 · cited 1×
“To date state-of-the-art quantum devices are able to outperform classical computers in a narrow range of tasks (25,26), however, there have not yet been any concrete demonstrations of quantum advantage for commercial applications primarily due to the fact that QCs are limited in size and capabilities (27).”
BackgroundVienna RNA secondary structure server
Hofacker, I. L. (2003) · Nucleic Acids Research · doi:10.1093/nar/gkg599 · Cited by 2,345 · cited 1×
“Classic approaches to sampling RNA secondary structure configurations utilize dynamic programming [9,20,21], while more recent methods have employed simulated annealing and Monte Carlo methods [22–24].”
MethodReplica Monte Carlo Simulation of Spin-Glasses
Swendsen, R. H., & Wang, J.-S. (1986) · Physical Review Letters · doi:10.1103/physrevlett.57.2607 · Cited by 2,031
Quantum Chemistry in the Age of Quantum Computing
Cao, Y., Romero, J., Olson, J. P., Degroote, M., Johnson, P. D., Kieferová, M., Kivlichan, I. D., Menke, T., Peropadre, B., Sawaya, N. P. D., et al. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.8b00803 · Cited by 1,560
The cell: a molecular approach
(1997) · Choice Reviews Online · doi:10.5860/choice.35-0264 · Cited by 1,445
Simulated Quantum Computation of Molecular Energies
Aspuru-Guzik, A., Dutoi, A. D., Love, P. J., & Head-Gordon, M. (2005) · Science · doi:10.1126/science.1113479 · Cited by 1,418
Quantum Chemistry in the Age of Quantum Computing
Cao, Y., Romero, J., Olson, J., Degroote, M., Johnson, P., Kieferová, M., Kivlichan, I., Menke, T., Peropadre, B., Sawaya, N., et al. (n.d.) · OPUS - Open Publications of UTS Scholars (University of Technology Sydney) · Cited by 1,265
Annealing Markov Chain Monte Carlo with Applications to Ancestral Inference
Geyer, C. J., & Thompson, E. A. (1995) · Journal of the American Statistical Association · doi:10.1080/01621459.1995.10476590 · Cited by 910
The non-Watson-Crick base pairs and their associated isostericity matrices
Leontis, N. B. (2002) · Nucleic Acids Research · doi:10.1093/nar/gkf481 · Cited by 796 · cited 1×
“(see [44] for a thorough discussion about non-Watson-Crick base pairs).”
BackgroundThe Eukaryotic Genome as an RNA Machine
Amaral, P. P., Dinger, M. E., Mercer, T. R., & Mattick, J. S. (2008) · Science · doi:10.1126/science.1155472 · Cited by 619
Parallel distributed computing using Python
Dalcin, L. D., Paz, R. R., Kler, P. A., & Cosimo, A. (2011) · Advances in Water Resources · doi:10.1016/j.advwatres.2011.04.013 · Cited by 590
Pfold: RNA secondary structure prediction using stochastic context-free grammars
Knudsen, B., & Hein, J. (2003) · Nucleic Acids Research · doi:10.1093/nar/gkg614 · Cited by 456
Ribozymes, riboswitches and beyond: regulation of gene expression without proteins
Serganov, A., & Patel, D. J. (2007) · Nature Reviews Genetics · doi:10.1038/nrg2172 · Cited by 436 · cited 1×
“Equation (3) can be formulated as the Hamiltonian of a quantum system by taking the inner”
BackgroundRNAstructure: web servers for RNA secondary structure prediction and analysis
Bellaousov, S., Reuter, J. S., Seetin, M. G., & Mathews, D. H. (2013) · Nucleic Acids Research · doi:10.1093/nar/gkt290 · Cited by 432 · cited 1×
“δ%* = @ c- if pseudoknot between stems i and j 1 if no pseudoknots , −1 ≤ c- ≤ 1 (7)”
BackgroundAn, J., Yang, J., Wang, Y., Wang, Y., Xu, B., Xie, G., Chai, S., Liu, X., Xu, S., Wen, X., et al. (2019) · Frontiers in Genetics · doi:10.3389/fgene.2019.00001 · Cited by 424
Singh, J., Hanson, J., Paliwal, K., & Zhou, Y. (2019) · Nature Communications · doi:10.1038/s41467-019-13395-9 · Cited by 411 · cited 4×
“RNAstructure ProbKnot 6.3 (41), SPOT-RNA (11), and ViennaRNA RNAfold 2.4.12 (42) were all run locally on an HPC cluster using command line defaults.”
MethodInfluentialDalcín, L., Paz, R., & Storti, M. (2005) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2005.03.010 · Cited by 408
Polynomial-time quantum algorithm for the simulation of chemical dynamics
Kassal, I., Jordan, S. P., Love, P. J., Mohseni, M., & Aspuru-Guzik, A. (2008) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0808245105 · Cited by 385 · cited 1×
“While applications utilizing quantum mechanical calculations, such as quantum chemistry, have clear maps to QCs (see, for example, (30–33)) at present these problems require too many qubits for current hardware to solve industrially relevant problems (29,34).”
BackgroundDeng, M.-T., Zhu, F., Yang, Y.-Z., Yang, F.-X., Hao, J.-P., Chen, S.-R., & Hou, Z.-C. (2019) · BMC Genomics · doi:10.1186/s12864-018-5379-1 · Cited by 383
Huang, T.-Y., Huang, G.-L., Zhang, C.-Y., Zhuang, B.-W., Liu, B.-X., Su, L.-Y., Ye, J.-Y., Xu, M., Kuang, M., & Xie, X.-Y. (2020) · Frontiers in Chemistry · doi:10.3389/fchem.2020.00001 · Cited by 361
RNA Pseudoknot Prediction in Energy-Based Models
Lyngsø, R. B., & Pedersen, C. N. S. (2000) · Journal of Computational Biology · doi:10.1089/106652700750050862 · Cited by 359 · cited 1×
“A widely used minimum free energy (MFE) approach to RNA secondary structure with pseudoknots is an NPcomplete computational problem (17).”
MethodMPI for Python: Performance improvements and MPI-2 extensions
Dalcín, L., Paz, R., Storti, M., & D’Elía, J. (2008) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2007.09.005 · Cited by 328
On the acceptance probability of replica-exchange Monte Carlo trials
Kofke, D. A. (2002) · The Journal of Chemical Physics · doi:10.1063/1.1507776 · Cited by 237 · cited 1×
“However, as the complexity of the objective surface grows with increasing numbers of stems and possible states, obtaining effective sampling of the landscape becomes challenging with simulated annealing, often requiring increasingly complex cooling schedules, continuous tuning of the initial sampling temperature, or d…”
BackgroundCambray, G., Guimaraes, J. C., & Arkin, A. P. (2018) · Nature Biotechnology · doi:10.1038/nbt.4238 · Cited by 235
Commercial applications of quantum computing
Bova, F., Goldfarb, A., & Melko, R. G. (2021) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-021-00091-1 · Cited by 230
Efficient parameter estimation for RNA secondary structure prediction
Andronescu, M., Condon, A., Hoos, H. H., Mathews, D. H., & Murphy, K. P. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btm223 · Cited by 220 · cited 3×
“The total Hamiltonian is thus constructed by adding the Hamiltonian defined in Equation (8) with the constraint defined in Equation (11):”
BackgroundMethodProbKnot: Fast prediction of RNA secondary structure including pseudoknots
Bellaousov, S., & Mathews, D. H. (2010) · RNA · doi:10.1261/rna.2125310 · Cited by 217 · cited 6×
“Two of the methods, SPOT-RNA [11] and ProbKnot [41], are capable of predicting pseudoknots while the other method, ViennaRNA [42], is not.”
MethodInfluentialDBS: a fast and informative segmentation algorithm for DNA copy number analysis
Ruan, J., Liu, Z., Sun, M., Wang, Y., Yue, J., & Yu, G. (2019) · BMC Bioinformatics · doi:10.1186/s12859-018-2565-8 · Cited by 211
LinearFold: linear-time approximate RNA folding by 5'-to-3' dynamic programming and beam search
Huang, L., Zhang, H., Deng, D., Zhao, K., Liu, K., Hendrix, D. A., & Mathews, D. H. (2019) · Bioinformatics · doi:10.1093/bioinformatics/btz375 · Cited by 207 · cited 1×
“There also exist approximate methods that have been shown to have linear scaling (16).”
MethodRevolutions in RNA Secondary Structure Prediction
Mathews, D. H. (2006) · Journal of Molecular Biology · doi:10.1016/j.jmb.2006.01.067 · Cited by 200 · cited 1×
“Classic approaches to sampling RNA secondary structure configurations utilize dynamic programming [9,20,21], while more recent methods have employed simulated annealing and Monte Carlo methods [22–24].”
MethodSpeeding up the Consensus Clustering methodology for microarray data analysis
Giancarlo, R., & Utro, F. (2011) · Algorithms for Molecular Biology · doi:10.1186/1748-7188-6-1 · Cited by 166
PseudoBase: a database with RNA pseudoknots
van Batenburg, F. H. D. (2000) · Nucleic Acids Research · doi:10.1093/nar/28.1.201 · Cited by 143
Identification of Cancer-Related Long Non-Coding RNAs Using XGBoost With High Accuracy
Zhang, X., Li, T., Wang, J., Li, J., Chen, L., & Liu, C. (2019) · Frontiers in Genetics · doi:10.3389/fgene.2019.00735 · Cited by 141
Gorochowski, T. E., Ignatova, Z., Bovenberg, R. A. L., & Roubos, J. A. (2015) · Nucleic Acids Research · doi:10.1093/nar/gkv199 · Cited by 131
Zhang, H., Zhang, C., Li, Z., Li, C., Xu, W. D., Zhang, B., & Liu, Y. (2019) · Frontiers in Genetics · doi:10.3389/fgene.2019.00467 · Cited by 123 · cited 10×
“Incorporating this factor into the Hamiltonian yields Equation (8).”
MethodInfluentialQuantum algorithm for obtaining the energy spectrum of molecular systems
Wang, H., Kais, S., Aspuru-Guzik, A., & Hoffmann, M. R. (2008) · Physical Chemistry Chemical Physics · doi:10.1039/b804804e · Cited by 109 · cited 1×
“While applications utilizing quantum mechanical calculations, such as quantum chemistry, have clear maps to QCs (see, for example, (30–33)) at present these problems require too many qubits for current hardware to solve industrially relevant problems (29,34).”
BackgroundPseudoBase: structural information on RNA pseudoknots
van Batenburg, F. H. D. (2001) · Nucleic Acids Research · doi:10.1093/nar/29.1.194 · Cited by 106
Tunneling and Speedup in Quantum Optimization for Permutation-Symmetric Problems
Muthukrishnan, S., Albash, T., & Lidar, D. A. (2016) · Physical Review X · doi:10.1103/physrevx.6.031010 · Cited by 106
Recent advances in RNA folding
Fallmann, J., Will, S., Engelhardt, J., Grüning, B. A., Backofen, R., & Stadler, P. F. (2017) · Journal of Biotechnology · doi:10.1016/j.jbiotec.2017.07.007 · Cited by 106
Accuracy and Resource Estimations for Quantum Chemistry on a Near-Term Quantum Computer
Kühn, M., Zanker, S., Deglmann, P., Marthaler, M., & Weiß, H. (2019) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.9b00236 · Cited by 90
Alves, J., Combes, F., Ferrara, A., Forveille, T., & Shore, S. (2016) · Astronomy and Astrophysics · doi:10.1051/0004-6361/201629543 · Cited by 88
Quantum algorithm for obtaining the energy spectrum of molecular systems
Wang, H., Kais, S., Aspuru‐Guzik, A., & Hoffmann, M. R. (2008) · Digital Access to Scholarship at Harvard (DASH) (Harvard University) · Cited by 75
Efficient Combinatorial Optimization Using Quantum AnnealingPreprint
Djidjev, H. N., Chapuis, G., Hahn, G., & Rizk, G. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1801.08653 · Cited by 73
Taufer, M., Licon, A., Araiza, R., Mireles, D., van Batenburg, F. H. D., Gultyaev, A. P., & Leung, M. (2008) · Nucleic Acids Research · doi:10.1093/nar/gkn806 · Cited by 68
mRNA codon optimization with quantum computers
Fox, D. M., Branson, K., & Walker, R. C. (2021) · PLoS ONE · doi:10.1371/journal.pone.0259101 · Cited by 54
Self-citationApplication of Quantum Computing to Biochemical Systems: A Look to the Future
Cheng, H.-P., Deumens, E., Freericks, J. K., Li, C., & Sanders, B. A. (2020) · Frontiers in Chemistry · doi:10.3389/fchem.2020.587143 · Cited by 53
Bringmann, K., Grandoni, F., Saha, B., & Williams, V. V. (2016) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2016.48 · Cited by 52
Pegasus: The second connectivity graph for large-scale quantum annealing hardware
Dattani, N., Szalay, S., & Chancellor, N. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1901.07636 · Cited by 51
Elfving, V. E., Broer, B. W., Webber, M., Gavartin, J. L., Halls, M. D., Lorton, K. P., & Bochevarov, A. D. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2009.12472 · Cited by 51 · cited 2×
“It is speculated that the pharmaceutical, chemical, and life sciences industries will be the first fields to benefit from quantum computing technology [28,29].”
BackgroundSharma, P., Chawla, M., Sharma, S., & Mitra, A. (2010) · RNA · doi:10.1261/rna.1919010 · Cited by 43
A minimum-labeling approach for reconstructing protein networks across multiple conditions
Mazza, A., Gat‐Viks, I., Farhan, H., & Sharan, R. (2014) · Algorithms for Molecular Biology · doi:10.1186/1748-7188-9-1 · Cited by 33
Lu, W., Tang, Y., Wu, H., Huang, H., Fu, Q., Qiu, J., & Li, H. (2019) · BMC Bioinformatics · doi:10.1186/s12859-019-3258-7 · Cited by 32
Chemla, Y., Peeri, M., Heltberg, M. L., Eichler, J., Jensen, M. H., Tuller, T., & Alfonta, L. (2020) · Nature Communications · doi:10.1038/s41467-020-18577-4 · Cited by 24
RNA-RNA interaction prediction using genetic algorithm
Montaseri, S., Zare‐Mirakabad, F., & Charkari, N. M. (2014) · Algorithms for Molecular Biology · doi:10.1186/1748-7188-9-17 · Cited by 12
Zhang, K., Yuting, W., Yulin, L., Jun, L., & He, J. (2019) · BMC Genomics · doi:10.1186/s12864-019-6300-2 · Cited by 9
mRNA codon optimization on quantum computersPreprint
Fox, D. M., Branson, K., & Walker, R. C. (2021) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2021.02.19.431999 · Cited by 9 · cited 2×
“crucial process in reagent generation and mRNA vaccine development (37).”
BackgroundMethodSelf-citation
Research works printed but not linked: 2
- 2020, Messenger RNA encoding the full-length SARS-CoV-2 spike glycoprotein, WHO MedNet
- P. Smith-Goodson, 2020, Quantum Computing With Particles Of Light: A $215 Million Gamble, Forbes
Cited by
Pal, S., Bhattacharya, M., Lee, S.-S., & Chakraborty, C. (2024) · Molecular Biotechnology · doi:10.1007/s12033-023-00765-4 · Cited by 103
“Recently, Fox and his colleagues have shown that the RNA secondary structure prediction issue can be solved as Binary Quadratic Model, which can be addressed using quantum computing [86].”
The life and death of RNA across temperatures
Becskei, A., & Rahaman, S. (2022) · Computational and Structural Biotechnology Journal · doi:10.1016/j.csbj.2022.08.008 · Cited by 77
Quantum computing in bioinformatics: a systematic review mapping
Nałęcz-Charkiewicz, K., Charkiewicz, K., & Nowak, R. M. (2024) · Briefings in Bioinformatics · doi:10.1093/bib/bbae391 · Cited by 73
“[52] is another paper dealing with the problem of predicting the structure of biological sequences—here the focus is on predicting the secondary structure of RNA, where the task is formulated in the form of a binary quadratic model (BQM).”
BackgroundComputational design of mRNA vaccines
Kim, Y.-A., Mousavi, K., Yazdi, A. K., Zwierzyna, M., Cardinali, M., Fox, D. M., Peel, T., Coller, J., Aggarwal, K., & Maruggi, G. (2023) · Vaccine · doi:10.1016/j.vaccine.2023.07.024 · Cited by 51
Self-citationA primer for quantum computing and its applications to healthcare and biomedical research
Durant, T. J. S., Knight, E., Nelson, B. G., Dudgeon, S. N., Lee, S. J., Walliman, D., Young, H. P., Ohno-Machado, L., & Schulz, W. L. (2024) · Journal of the American Medical Informatics Association · doi:10.1093/jamia/ocae149 · Cited by 55
Metadata
- Authors
- Fox, D. M., MacDermaid, C. M., Schreij, A. M. A., Zwierzyna, M., & Walker, R. C.
- Affiliations
- GlaxoSmithKline (United States) (US)
- GlaxoSmithKline (Italy) (IT)
- University of California San Diego (US)
- Corresponding author
- Walker, Ross C.
- Venue
- PLOS Computational Biology
- Publisher
- Public Library of Science (PLoS)
- Published
- 2022-04-11
- Volume
- 18
- Issue
- 4
- Pages
- e1010032
- ISSN
- 1553-734X (ISSN-L)
- 1553-7358
- PMC
- PMC9022793
- OpenAlex
- W4226331643
- Cited by
- 33
- References
- 60
- Citations by year
- 2026: 5 · 2025: 9 · 2024: 8 · 2023: 6 · 2022: 5
- FWCI
- 2.29
- Type
- journal article
- Language
- en
- Update notices
- new_version (2022-04-21)
- Open access
- gold
- doi.org
- Licence
- Locations
- PLoS Computational Biology (publishedVersion, cc-by)
- bioRxiv (Cold Spring Harbor Laboratory) (acceptedVersion)
- PubMed Central (publishedVersion, cc-by)
- PubMed (publishedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- Topics
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › RNA and protein synthesis mechanisms
- Physical Sciences › Mathematics › Theoretical Computer Science › DNA and Biological Computing
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Keywords
- RNA secondary structure prediction, RNA folding, quantum annealing, Hamiltonian design, parallel tempering, pseudoknot, base pairing, NP-complete problems, quantum computing
- MeSH terms
- Algorithms, Computers, Computing Methodologies, Nucleic Acid Conformation, Quantum Theory, RNA, Computational Biology, RNA Folding
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.