The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Nucleic acid sequence design via efficient ensemble defect optimization
Abstract
We describe an algorithm for designing the sequence of one or more interacting nucleic acid strands intended to adopt a target secondary structure at equilibrium. Sequence design is formulated as an optimization problem with the goal of reducing the ensemble defect below a user‐specified stop condition. For a candidate sequence and a given target secondary structure, the ensemble defect is the average number of incorrectly paired nucleotides at equilibrium evaluated over the ensemble of unpseudoknotted secondary structures. To reduce the computational cost of accepting or rejecting mutations to a random initial sequence, candidate mutations are evaluated on the leaf nodes of a tree‐decomposition of the target structure. During leaf optimization, defect‐weighted mutation sampling is used to select each candidate mutation position with probability proportional to its contribution to the ensemble defect of the leaf. As subsequences are merged moving up the tree, emergent structural defects resulting from crosstalk between sibling sequences are eliminated via reoptimization within the defective subtree starting from new random subsequences. Using a Θ(N3) dynamic program to evaluate the ensemble defect of a target structure with N nucleotides, this hierarchical approach implies an asymptotic optimality bound on design time: for sufficiently large N, the cost of sequence design is bounded below by 4/3 the cost of a single evaluation of the ensemble defect for the full sequence. Hence, the design algorithm has time complexity Ω(N3). For target structures containing N ∈{100,200,400,800,1600,3200} nucleotides and duplex stems ranging from 1 to 30 base pairs, RNA sequence designs at 37°C typically succeed in satisfying a stop condition with ensemble defect less than N/100. Empirically, the sequence design algorithm exhibits asymptotic optimality and the exponent in the time complexity bound is sharp. © 2010 Wiley Periodicals, Inc. J Comput Chem, 2011
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
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
Cited by
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
Principles and Applications of Nucleic Acid Strand Displacement Reactions
Simmel, F. C., Yurke, B., & Singh, H. R. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.8b00580 · Cited by 792
Programmable in situ amplification for multiplexed imaging of mRNA expression
Choi, H. M. T., Chang, J. Y., Trinh, L. A., Padilla, J. E., Fraser, S. E., & Pierce, N. A. (2010) · Nature Biotechnology · doi:10.1038/nbt.1692 · Cited by 715
Self-citationNext-Generation in Situ Hybridization Chain Reaction: Higher Gain, Lower Cost, Greater Durability
Choi, H. M. T., Beck, V. A., & Pierce, N. A. (2014) · ACS Nano · doi:10.1021/nn405717p · Cited by 629
Self-citationA DNA-Based Archival Storage System
Bornholt, J., Lopez, R., Carmean, D. M., Ceze, L., Seelig, G., & Strauss, K. (2016) · Proceedings of the Twenty-First International Conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/2872362.2872397 · Cited by 316
Metadata
- Authors
- Zadeh, J. N., Wolfe, B. R., & Pierce, N. A.
- Venue
- Journal of Computational Chemistry
- Publisher
- Wiley
- Published
- 2010-08-17
- Volume
- 32
- Issue
- 3
- Pages
- 439-452
- ISSN
- 0192-8651 (ISSN-L)
- 1096-987X
- OpenAlex
- W2125615424
- Cited by
- 187
- References
- 1
- FWCI
- 3.54
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Nucleic acid sequence design via efficient ensemble defect optimization. https://app.cochat.ai/papers/10.1002/jcc.21633
- The paper
- Zadeh, J. N., Wolfe, B. R., & Pierce, N. A. (2011). Nucleic acid sequence design via efficient ensemble defect optimization. Journal of Computational Chemistry. https://doi.org/10.1002/jcc.21633
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.