Deterministic Polynomial-Time Algorithms for Designing Short DNA Words (Q3569085)

From MaRDI portal
Revision as of 05:21, 13 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q321024)
scientific article
Language Label Description Also known as
English
Deterministic Polynomial-Time Algorithms for Designing Short DNA Words
scientific article

    Statements

    Deterministic Polynomial-Time Algorithms for Designing Short DNA Words (English)
    0 references
    0 references
    0 references
    0 references
    17 June 2010
    0 references
    DNA computating
    0 references
    DNA words design
    0 references
    coding theory
    0 references
    expander codes
    0 references
    Ramanujan graphs
    0 references
    derandomization
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references