The DOI matches its Crossref record; 48 of the 48 references it cites were found in a registry or an index.
IPknot: fast and accurate prediction of RNA secondary structures with pseudoknots using integer programming
Open accessAbstract
Motivation: Pseudoknots found in secondary structures of a number of functional RNAs play various roles in biological processes. Recent methods for predicting RNA secondary structures cover certain classes of pseudoknotted structures, but only a few of them achieve satisfying predictions in terms of both speed and accuracy. Results: We propose IPknot, a novel computational method for predicting RNA secondary structures with pseudoknots based on maximizing expected accuracy of a predicted structure. IPknot decomposes a pseudoknotted structure into a set of pseudoknot-free substructures and approximates a base-pairing probability distribution that considers pseudoknots, leading to the capability of modeling a wide class of pseudoknots and running quite fast. In addition, we propose a heuristic algorithm for refining base-paring probabilities to improve the prediction accuracy of IPknot. The problem of maximizing expected accuracy is solved by using integer programming with threshold cut. We also extend IPknot so that it can predict the consensus secondary structure with pseudoknots when a multiple sequence alignment is given. IPknot is validated through extensive experiments on various datasets, showing that IPknot achieves better prediction accuracy and faster running time as compared with several competitive prediction methods. Availability: The program of IPknot is available at http://www.ncrna.org/software/ipknot/. IPknot is also available as a web server at http://rna.naist.jp/ipknot/. Contact: satoken@k.u-tokyo.ac.jp; ykato@is.naist.jp Supplementary information: Supplementary data are available at Bioinformatics online.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Thompson, J. D., Higgins, D. G., & Gibson, T. J. (1994) · Nucleic Acids Research · doi:10.1093/nar/22.22.4673 · Cited by 64,617
Mfold web server for nucleic acid folding and hybridization prediction
Zuker, M. (2003) · Nucleic Acids Research · doi:10.1093/nar/gkg595 · Cited by 13,404
Mathews, D. H., Sabina, J., Zuker, M., & Turner, D. H. (1999) · Journal of Molecular Biology · doi:10.1006/jmbi.1999.2700 · Cited by 3,795
Optimal 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
Vienna RNA secondary structure server
Hofacker, I. L. (2003) · Nucleic Acids Research · doi:10.1093/nar/gkg599 · Cited by 2,345
Fast folding and comparison of RNA secondary structures
Hofacker, I. L., Fontana, W., Stadler, P. F., Bonhoeffer, L. S., Tacker, M., & Schuster, P. (1994) · Monatshefte f�r Chemie Chemical Monthly · doi:10.1007/bf00818163 · Cited by 2,306
Non–coding RNA genes and the modern RNA world
Eddy, S. R. (2001) · Nature Reviews Genetics · doi:10.1038/35103511 · Cited by 1,426
The equilibrium partition function and base pair binding probabilities for RNA secondary structure
McCaskill, J. S. (1990) · Biopolymers · doi:10.1002/bip.360290621 · Cited by 1,310
ProbCons: Probabilistic consistency-based multiple sequence alignment
Do, C. B., Mahabhashyam, M. S. P., Brudno, M., & Batzoglou, S. (2005) · Genome Research · doi:10.1101/gr.2821705 · Cited by 1,114
Rivas, E., & Eddy, S. R. (1999) · Journal of Molecular Biology · doi:10.1006/jmbi.1998.2436 · Cited by 754
Cited by
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
“…replacing the cubic-time McCaskill algorithm with a linear-time one in those heuristic pseudoknot-prediction programs (Bellaousov and Mathews, 2010; Sato et al. , 2011), or linearizing a supercubic-time dynamic program for direct prediction with pseudoknots (Dirks and Pierce, 2003; Reeder and…”
MethodKagaya, Y., Zhang, Z., Ibtehaz, N., Wang, X., Nakamura, T., Punuru, P. D., & Kihara, D. (2025) · Nature Communications · doi:10.1038/s41467-025-56261-7 · Cited by 70
State-of-the-RNArt: benchmarking current methods for RNA 3D structure prediction
Bernard, C., Postic, G., Ghannay, S., & Tahi, F. (2024) · NAR Genomics and Bioinformatics · doi:10.1093/nargab/lqae048 · Cited by 40
Assessment of Nucleic Acid Structure Prediction in CASP16
Kretsch, R. C., Hummer, A. M., He, S., Yuan, R., Zhang, J., Karagianes, T., Cong, Q., Kryshtafovych, A., & Das, R. (2026) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.70072 · Cited by 51
Novel BDNF-regulatory microRNAs in neurodegenerative disorders pathogenesis: An in silico study
Khani-Habibabadi, F., Askari, S., Zahiri, J., Javan, M., & Behmanesh, M. (2019) · Computational Biology and Chemistry · doi:10.1016/j.compbiolchem.2019.107153 · Cited by 18
Metadata
- Authors
- Sato, K., Kato, Y., Hamada, M., Akutsu, T., & Asai, K.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2011-06-14
- Volume
- 27
- Issue
- 13
- Pages
- i85-i93
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2134489577
- Cited by
- 331
- References
- 48
- FWCI
- 4.23
- Type
- journal article
- Language
- en
- Open access
- hybrid
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: IPknot: fast and accurate prediction of RNA secondary structures with pseudoknots using integer programming. https://app.cochat.ai/papers/10.1093/bioinformatics/btr215
- The paper
- Sato, K., Kato, Y., Hamada, M., Akutsu, T., & Asai, K. (2011). IPknot: fast and accurate prediction of RNA secondary structures with pseudoknots using integer programming. Bioinformatics. https://doi.org/10.1093/bioinformatics/btr215
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.