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

From MaRDI portal
Revision as of 17:34, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Deterministic Polynomial-Time Algorithms for Designing Short DNA Words
scientific article

    Statements

    title
    Deterministic Polynomial-Time Algorithms for Designing Short DNA Words (English)
    0 references
    author
    Henry C. M. Leung
    0 references
    He Sun
    0 references
    Yong Zhang
    0 references
    Ming-Yang Kao
    0 references
    publication date
    17 June 2010
    0 references
    Mathematics Subject Classification ID
    92D20
    0 references
    68Q05
    0 references
    68W32
    0 references
    94B60
    0 references
    zbMATH DE Number
    5723190
    0 references
    zbMATH Keywords
    DNA computating
    0 references
    DNA words design
    0 references
    coding theory
    0 references
    expander codes
    0 references
    Ramanujan graphs
    0 references
    derandomization
    0 references
    OpenAlex ID
    W2108251045
    0 references
    arXiv ID
    1201.6358
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3569085&oldid=33634509"
    Powered by MediaWiki