The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Algorithms for Loop Matchings
Abstract
A simplified (two-base) version of the problem of planar folding of long chains (e.g., RNA and DNA biomolecules) is formulated as a matching problem. The chain is prescribed as a loop or circular sequence of letters A and B, n units long. A matching here means a set of A-B base pairings or matches obeying a planarity condition: no two matches may cross each other if drawn on the interior of the loop. Also, no two adjacent letters may be matched. We present a dynamic programming algorithm requiring $O( {n^3 } )$ steps and $O( {n^2 } )$ storage which computes the size of the maximum for the given A-B base sequence and which also allows reconstructing a particular folded form of the original string which realizes the maximum matching size. The algorithm can be adapted to deal with sequences with larger alphabets and with weighted matchings. An algorithm is also presented for a modified problem closer to the biochemical problem of interest: We demand that every match must be adjacent to another match, forcing groups of two or more parallel matches. Some results on the expected maximum matching size are presented. As $n \to \infty $, at least 80% of the vertices can be matched on the average on an A-B string of size n. We briefly discuss the practical application of the algorithm by using contracted versions of very long molecules with a preliminary block construction. A maximum matching is presented for the J-gene of the $\phi $X174 DNA virus. We conclude by stating some problems requiring further study.
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
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.
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
The String-to-String Correction Problem
Wagner, R. A., & Fischer, M. J. (1974) · Journal of the ACM · doi:10.1145/321796.321811 · Cited by 3,032
Fast Pattern Matching in Strings
Knuth, D. E., Morris, Jr., & Pratt, V. R. (1977) · SIAM Journal on Computing · doi:10.1137/0206024 · Cited by 2,936
Improved Estimation of Secondary Structure in Ribonucleic Acids
TINOCO, I., BORER, P. N., DENGLER, B., LEVINE, M. D., UHLENBECK, O. C., CROTHERS, D. M., & GRALLA, J. (1973) · Nature New Biology · doi:10.1038/newbio246040a0 · Cited by 2,268
Nucleotide sequence of bacteriophage φX174 DNA
Sanger, F., Air, G. M., Barrell, B. G., Brown, N. L., Coulson, A. R., Fiddes, J. C., Hutchison, C. A., Slocombe, P. M., & Smith, M. (1977) · Nature · doi:10.1038/265687a0 · Cited by 1,615
Structure of yeast phenylalanine tRNA at 3 Å resolution
Robertus, J. D., Ladner, J. E., Finch, J. T., Rhodes, D., Brown, R. S., Clark, B. F. C., & Klug, A. (1974) · Nature · doi:10.1038/250546a0 · Cited by 1,032
Fiers, W., Contreras, R., Duerinck, F., Haegeman, G., Iserentant, D., Merregaert, J., Min Jou, W., Molemans, F., Raeymaekers, A., Van den Berghe, A., et al. (1976) · Nature · doi:10.1038/260500a0 · Cited by 814
Longest common subsequences of two random sequences
Chvátal, V., & Sankoff, D. (1975) · Journal of Applied Probability · doi:10.2307/3212444 · Cited by 240
Three-dimensional structure of yeast phenylalanine transfer RNA at 3. 0Å resolution
Suddath, F. L., Quigley, G. J., McPherson, A., Sneden, D., Kim, J. J., Kim, S., & Rich, A. (1974) · Nature · doi:10.1038/248020a0 · Cited by 157
Method for predicting RNA secondary structure.
Pipas, J. M., & McMahon, J. E. (1975) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.72.6.2017 · Cited by 124
Direct physical evidence for secondary structure in an isolated fragment of R17 bacteriophage mRNA
Gralla, J. D., STEITZ, J. A., & Crothers, D. M. (1974) · Nature · doi:10.1038/248204a0 · Cited by 87
Cited by
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
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
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
On Finding All Suboptimal Foldings of an RNA Molecule
Zuker, M. (1989) · Science · doi:10.1126/science.2468181 · Cited by 2,005
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
Rivas, E., & Eddy, S. R. (1999) · Journal of Molecular Biology · doi:10.1006/jmbi.1998.2436 · Cited by 754
Secondary Structure Prediction for Aligned RNA Sequences
Hofacker, I. L., Fekete, M., & Stadler, P. F. (2002) · Journal of Molecular Biology · doi:10.1016/s0022-2836(02)00308-x · Cited by 639
Complete suboptimal folding of RNA and the stability of secondary structures
Wuchty, S., Fontana, W., Hofacker, I. L., & Schuster, P. (1999) · Biopolymers · doi:10.1002/(sici)1097-0282(199902)49:2<145::aid-bip4>3.0.co;2-g · Cited by 567
Simultaneous Solution of the RNA Folding, Alignment and Protosequence Problems
Sankoff, D. (1985) · SIAM Journal on Applied Mathematics · doi:10.1137/0145048 · Cited by 530
RNA secondary structures and their prediction
Zuker, M., & Sankoff, D. (1984) · Bulletin of Mathematical Biology · doi:10.1007/bf02459506 · Cited by 511
Plasticity, evolvability, and modularity in RNA
Ancel, L. W., & Fontana, W. (2000) · Journal of Experimental Zoology · doi:10.1002/1097-010x(20001015)288:3<242::aid-jez5>3.0.co;2-o · Cited by 458
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
[20] Computer prediction of RNA structure
Zuker, M. (1989) · Methods in Enzymology · doi:10.1016/0076-6879(89)80106-5 · Cited by 388
[17] Predicting optimal and suboptimal secondary structure for RNA
Jaeger, J. A., Turner, D. H., & Zuker, M. (1990) · Methods in Enzymology · doi:10.1016/0076-6879(90)83019-6 · Cited by 382
Thermodynamics of RNA–RNA binding
Mückstein, U., Tafer, H., Hackermüller, J., Bernhart, S. H., Stadler, P. F., & Hofacker, I. L. (2006) · Bioinformatics · doi:10.1093/bioinformatics/btl024 · Cited by 379
A partition function algorithm for nucleic acid secondary structure including pseudoknots
Dirks, R. M., & Pierce, N. A. (2003) · Journal of Computational Chemistry · doi:10.1002/jcc.10296 · 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
Thermodynamic Analysis of Interacting Nucleic Acid Strands
Dirks, R. M., Bois, J. S., Schaeffer, J. M., Winfree, E., & Pierce, N. A. (2007) · SIAM Review · doi:10.1137/060651100 · Cited by 356
A comprehensive comparison of comparative RNA structure prediction approaches
Gardner, P. P., & Giegerich, R. (2004) · BMC Bioinformatics · doi:10.1186/1471-2105-5-140 · Cited by 352
Partition function and base pairing probabilities of RNA heterodimers
Bernhart, S. H., Tafer, H., Mückstein, U., Flamm, C., Stadler, P. F., & Hofacker, I. L. (2006) · Algorithms for Molecular Biology · doi:10.1186/1748-7188-1-3 · Cited by 303
Dowell, R. D., & Eddy, S. R. (2004) · BMC Bioinformatics · doi:10.1186/1471-2105-5-71 · Cited by 280
Rivas, E., & Eddy, S. R. (2000) · Bioinformatics · doi:10.1093/bioinformatics/16.7.583 · Cited by 279
A benchmark of multiple sequence alignment programs upon structural RNAs
Gardner, P. P. (2005) · Nucleic Acids Research · doi:10.1093/nar/gki541 · Cited by 273
Xayaphoummine, A., Bucher, T., & Isambert, H. (2005) · Nucleic Acids Research · doi:10.1093/nar/gki447 · Cited by 262
Generic properties of combinatory maps: Neutral networks of RNA secondary structures
Reidys, C., Stadler, P. F., & Schuster, P. (1997) · Bulletin of Mathematical Biology · doi:10.1007/bf02462007 · Cited by 254
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
“, 2009), all use virtually the same dynamic programming (DP) algorithm (Nussinov et al. , 1978; Zuker and Stiegler, 1981) to find the best-scoring (lowest free energy, maximum expected accuracy, or best model score) structure (Mathews and Turner, 2006; Washietl et al. , 2012).”
The four ingredients of single-sequence RNA secondary structure prediction. A unifying perspective
Rivas, E. (2013) · RNA Biology · doi:10.4161/rna.24971 · Cited by 57
Terai, G., Kamegai, S., & Asai, K. (2016) · Bioinformatics · doi:10.1093/bioinformatics/btv678 · Cited by 36
Szikszai, M., Wang, T.-Y., Krueger, R., Mathews, D. H., Ward, M., & Aviran, S. (2026) · RNA · doi:10.1261/rna.080846.125 · Cited by 5
Fukunaga, T., & Hamada, M. (2022) · Bioinformatics Advances · doi:10.1093/bioadv/vbac078 · Cited by 5
Comprehensive datasets for RNA design, machine learning, and beyond
Badura, J., Rybarczyk, A., & Zok, T. (2025) · Scientific Reports · doi:10.1038/s41598-025-07041-2 · Cited by 3
Metadata
- Authors
- Nussinov, R., Pieczenik, G., Griggs, J. R., & Kleitman, D. J.
- Venue
- SIAM Journal on Applied Mathematics
- Published
- 1978-07
- Volume
- 35
- Issue
- 1
- Pages
- 68-82
- ISSN
- 0036-1399 (ISSN-L)
- 1095-712X
- OpenAlex
- W2054931730
- Cited by
- 587
- References
- 12
- FWCI
- 0.90
- Type
- journal article
- Language
- en
- Open access
- closed
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.