Cited by 36RNA and protein synthesis mechanismsAlgorithms and Data CompressionDNA and Biological Computing

Natural Selection and Algorithmic Design of mRNA

Cohen, Barry, Skiena, Steven·2003·Journal of Computational Biology

Abstract

Messenger RNA (mRNA) sequences serve as templates for proteins according to the triplet code, in which each of the 4(3) = 64 different codons (sequences of three consecutive nucleotide bases) in RNA either terminate transcription or map to one of the 20 different amino acids (or residues) which build up proteins. Because there are more codons than residues, there is inherent redundancy in the coding. Certain residues (e.g., tryptophan) have only a single corresponding codon, while other residues (e.g., arginine) have as many as six corresponding codons. This freedom implies that the number of possible RNA sequences coding for a given protein grows exponentially in the length of the protein. Thus nature has wide latitude to select among mRNA sequences which are informationally equivalent, but structurally and energetically divergent. In this paper, we explore how nature takes advantage of this freedom and how to algorithmically design structures more energetically favorable than have been built through natural selection. In particular: (1) Natural Selection--we perform the first large-scale computational experiment comparing the stability of mRNA sequences from a variety of organisms to random synonymous sequences which respect the codon preferences of the organism. This experiment was conducted on over 27,000 sequences from 34 microbial species with 36 genomic structures. We provide evidence that in all genomic structures highly stable sequences are disproportionately abundant, and in 19 of 36 cases highly unstable sequences are disproportionately abundant. This suggests that the stability of mRNA sequences is subject to natural selection. (2) Artificial Selection--motivated by these biological results, we examine the algorithmic problem of designing the most stable and unstable mRNA sequences which code for a target protein. We give a polynomial-time dynamic programming solution to the most stable sequence problem (MSSP), which is asymptotically no more complex than secondary structure prediction. We show that the corresponding least stable sequence problem (LSSP) is NP-complete, and develop two heuristics for the construction of such sequences. We have implemented these algorithms, and present experimental results placing the high/low stability sequences in context with both wildtype and random encodings. Our implementation has already been applied to the design of RNA "code-words" creating little or no secondary structure in RNA computing (Brenneman and Condon, 2001; Marathe et al., 2001), and we anticipate a variety of other applications of this work to sequence design problems (Skiena, 2001).

Integrity signals

Registry

Crossref · 10.1089/10665270360688101

Cites

22 of 22 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?

  • 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.”
  • Cohen et al. only optimize stability without considering codon optimality.

    “First, Cohen et al. only optimize stability without considering codon optimality.”
  • 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.”
  • 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.”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Cohen, B., & Skiena, S.
Affiliations
  • New Jersey Institute of Technology (US)
  • Stony Brook University (US)
Venue
Journal of Computational Biology
Published
2003-06
Volume
10
Issue
3-4
Pages
419-432
ISSN
  • 1066-5277 (ISSN-L)
  • 1557-8666
OpenAlex
W2039590841
Cited by
35
References
22
Citations by year
2026: 3 · 2025: 4 · 2024: 1 · 2023: 2 · 2022: 2 · 2021: 1 · 2020: 2 · 2016: 2 · 2014: 3 · 2012: 1
FWCI
1.15
Type
journal article
Language
en
Open access
closed
Locations
  • Journal of Computational Biology (publishedVersion)
  • PubMed (publishedVersion)
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › RNA and protein synthesis mechanisms
  • Physical Sciences › Computer Science › Artificial Intelligence › Algorithms and Data Compression
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › DNA and Biological Computing
Keywords
codon usage, synonymous codons, mRNA stability, natural selection, selective breeding, NP-completeness, dynamic programming, RNA secondary structure, codon redundancy, microbial genomes
MeSH terms
Algorithms, Data Interpretation, Statistical, Nucleic Acid Conformation, RNA, Messenger, Selection, Genetic, Sequence Analysis, RNA, Evolution, Molecular, Computational Biology

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