Cited by 36RNA and protein synthesis mechanismsProtein Structure and DynamicsRNA Research and Splicing

CDSfold: an algorithm for designing a protein-coding sequence with the most stable secondary structure

Terai, Goro, Kamegai, Satoshi, Asai, Kiyoshi·2016·Bioinformatics

Abstract

Motivation: An important problem in synthetic biology is to design a nucleotide sequence of an mRNA that confers a desirable expression level of a target protein. The secondary structure of protein-coding sequences (CDSs) is one potential factor that could have both positive and negative effects on protein production. To elucidate the role of secondary structure in CDSs, algorithms for manipulating secondary structure should be developed. Results: We developed an algorithm for designing a CDS with the most stable secondary structure among all possible ones translated into the same protein, and implemented it as the program CDSfold. The algorithm runs the Zuker algorithm under the constraint of a given amino acid sequence. The time and space complexity is O(L3) and O(L2), respectively, where L is the length of the CDS to be designed. Although our algorithm is slower than the original Zuker algorithm, it could design a relatively long (2.7-kb) CDS in approximately 1 h. Availability and implementation: The CDSfold program is freely available for non-commercial users as stand-alone and web-based software from http://cdsfold.trahed.jp/cdsfold/. Contacts: terai-goro@aist.go.jp or asai@k.u-tokyo.ac.jp Supplementary information: Supplementary data are available at Bioinformatics online.

Integrity signals

Registry

Crossref · 10.1093/bioinformatics/btv678

Cites

29 of 29 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

  • Cohen et al. and CDSfold do not have any graph-theoretic or formal representation of the design space.

    “By contrast, Cohen et al. and CDSfold extend the standard Zuker algorithm with the consideration of amino acid constraints, and they do not have any graph-theoretic or formal representation of the design space.”
  • CDSfold uses simulated annealing to improve CAI by fine-tuning from the MFE solution, but this is a heuristic with no guarantees.

    “CDSfold uses simulated annealing to improve CAI by fine-tuning from the MFE solution, but this is a heuristic with no guarantees.”
  • The stability-only version of this work reduced the mRNA design problem to lattice parsing, resulting in a simpler and more efficient algorithm than previous specifically-designed algorithms.

    “By contrast, the stability-only version of our work reduced the mRNA design problem to the classical computational linguistics problem of lattice parsing, resulting in a much simpler and more efficient algorithm that is vastly different from the specifically-designed algorithms such as the one described in Cohen et al.22 and CDSfold23.”
  • Two previous studies also tackled optimal-stability mRNA design via dynamic programming, but their algorithms are complicated, not generalizable and less efficient.

    “Two previous studies22,23 also tackled the problem of optimal-stability mRNA design (that is, our objective 1) via dynamic programming, but their algorithms are complicated, not generalizable and less efficient.”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Terai, G., Kamegai, S., & Asai, K.
Affiliations
  • Intec Inc. (Japan) (JP)
  • National Institute of Advanced Industrial Science and Technology (JP)
Corresponding author
  • Terai, Goro
  • Asai, Kiyoshi
Venue
Bioinformatics
Published
2015-11-20
Volume
32
Issue
6
Pages
828-834
ISSN
  • 1367-4803 (ISSN-L)
  • 1367-4811
OpenAlex
W2179601024
Cited by
36
References
29
Citations by year
2026: 11 · 2025: 10 · 2024: 6 · 2023: 2 · 2022: 2 · 2021: 2 · 2020: 1 · 2019: 1 · 2016: 1
FWCI
0.14
Type
journal article
Language
en
Open access
closed
Locations
  • Bioinformatics (publishedVersion)
  • PubMed (publishedVersion)
  • HighWire Press Open Archive (submittedVersion)
Funders
  • National Institute of Advanced Industrial Science and Technology
  • Vedecká Grantová Agentúra MŠVVaŠ SR a SAV
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › RNA and protein synthesis mechanisms
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Protein Structure and Dynamics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › RNA Research and Splicing
Keywords
mRNA secondary structure, protein expression, synthetic biology, web application
MeSH terms
Algorithms, Amino Acid Sequence, Base Sequence, Software, Open Reading Frames, Sequence Alignment, Protein Structure, Secondary

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