DNA computing and its application

Junzo Watada

    Research output: Chapter in Book/Report/Conference proceedingChapter

    21 Citations (Scopus)

    Abstract

    The objectives of this Chapter are twofold: firstly to introduce DNA computation, and secondly to demonstrate how DNA computing can be applied to solve large, complex combinatorial problems, such as the optimal scheduling of a group of elevators servicing a number of floors in a multi-storey building. Recently, molecular (or wet) computing has been widely researched not only within the context of solving NP-complete/NP-hard problems -which are the most difficult problems in NP -but also implementation by way of digital (silicon-based) computers [23]. We commence with a description of the basic concepts of 'wet computation', then present recent results for the efficient management of a group of elevators.

    Original languageEnglish
    Title of host publicationStudies in Computational Intelligence
    Pages1065-1089
    Number of pages25
    Volume115
    DOIs
    Publication statusPublished - 2008

    Publication series

    NameStudies in Computational Intelligence
    Volume115
    ISSN (Print)1860949X

    Fingerprint

    Elevators
    DNA
    Computational complexity
    Scheduling
    Silicon

    ASJC Scopus subject areas

    • Artificial Intelligence

    Cite this

    Watada, J. (2008). DNA computing and its application. In Studies in Computational Intelligence (Vol. 115, pp. 1065-1089). (Studies in Computational Intelligence; Vol. 115). https://doi.org/10.1007/978-3-540-78293-3_24

    DNA computing and its application. / Watada, Junzo.

    Studies in Computational Intelligence. Vol. 115 2008. p. 1065-1089 (Studies in Computational Intelligence; Vol. 115).

    Research output: Chapter in Book/Report/Conference proceedingChapter

    Watada, J 2008, DNA computing and its application. in Studies in Computational Intelligence. vol. 115, Studies in Computational Intelligence, vol. 115, pp. 1065-1089. https://doi.org/10.1007/978-3-540-78293-3_24
    Watada J. DNA computing and its application. In Studies in Computational Intelligence. Vol. 115. 2008. p. 1065-1089. (Studies in Computational Intelligence). https://doi.org/10.1007/978-3-540-78293-3_24
    Watada, Junzo. / DNA computing and its application. Studies in Computational Intelligence. Vol. 115 2008. pp. 1065-1089 (Studies in Computational Intelligence).
    @inbook{3644d943a1c44c1d8f15b9f14a39b754,
    title = "DNA computing and its application",
    abstract = "The objectives of this Chapter are twofold: firstly to introduce DNA computation, and secondly to demonstrate how DNA computing can be applied to solve large, complex combinatorial problems, such as the optimal scheduling of a group of elevators servicing a number of floors in a multi-storey building. Recently, molecular (or wet) computing has been widely researched not only within the context of solving NP-complete/NP-hard problems -which are the most difficult problems in NP -but also implementation by way of digital (silicon-based) computers [23]. We commence with a description of the basic concepts of 'wet computation', then present recent results for the efficient management of a group of elevators.",
    author = "Junzo Watada",
    year = "2008",
    doi = "10.1007/978-3-540-78293-3_24",
    language = "English",
    isbn = "9783540782926",
    volume = "115",
    series = "Studies in Computational Intelligence",
    pages = "1065--1089",
    booktitle = "Studies in Computational Intelligence",

    }

    TY - CHAP

    T1 - DNA computing and its application

    AU - Watada, Junzo

    PY - 2008

    Y1 - 2008

    N2 - The objectives of this Chapter are twofold: firstly to introduce DNA computation, and secondly to demonstrate how DNA computing can be applied to solve large, complex combinatorial problems, such as the optimal scheduling of a group of elevators servicing a number of floors in a multi-storey building. Recently, molecular (or wet) computing has been widely researched not only within the context of solving NP-complete/NP-hard problems -which are the most difficult problems in NP -but also implementation by way of digital (silicon-based) computers [23]. We commence with a description of the basic concepts of 'wet computation', then present recent results for the efficient management of a group of elevators.

    AB - The objectives of this Chapter are twofold: firstly to introduce DNA computation, and secondly to demonstrate how DNA computing can be applied to solve large, complex combinatorial problems, such as the optimal scheduling of a group of elevators servicing a number of floors in a multi-storey building. Recently, molecular (or wet) computing has been widely researched not only within the context of solving NP-complete/NP-hard problems -which are the most difficult problems in NP -but also implementation by way of digital (silicon-based) computers [23]. We commence with a description of the basic concepts of 'wet computation', then present recent results for the efficient management of a group of elevators.

    UR - http://www.scopus.com/inward/record.url?scp=44849104282&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=44849104282&partnerID=8YFLogxK

    U2 - 10.1007/978-3-540-78293-3_24

    DO - 10.1007/978-3-540-78293-3_24

    M3 - Chapter

    AN - SCOPUS:44849104282

    SN - 9783540782926

    VL - 115

    T3 - Studies in Computational Intelligence

    SP - 1065

    EP - 1089

    BT - Studies in Computational Intelligence

    ER -