A DNA-based algorithm for arranging weighted cliques

Ikno Kim, Junzo Watada, Witold Pedrycz

    Research output: Contribution to journalArticle

    7 Citations (Scopus)

    Abstract

    A fundamental idea and realization of networks arises in a variety of areas of science and engineering. Their theoretical underpinnings stem from graph theory where numerous fundamental concepts being formulated and solved there have become of immediate interest at the applied side. In this study, our focus is on the weighted maximum clique problem, a highly challenging problem in graph theory. The essence of the problem is to find the nodes with the maximum total of weights in a graph where an edge connects every pair of nodes, meaning every node connects to every other node. We propose an algorithm to find all the weighted cliques as well as the weighted maximum clique in order of size using the framework of DNA computing.

    Original languageEnglish
    Pages (from-to)1561-1570
    Number of pages10
    JournalSimulation Modelling Practice and Theory
    Volume16
    Issue number10
    DOIs
    Publication statusPublished - 2008 Nov

    Fingerprint

    Graph theory
    Clique
    DNA
    Vertex of a graph
    Maximum Clique Problem
    DNA Computing
    Maximum Clique
    Engineering
    Graph in graph theory

    Keywords

    • DNA oligonucleotide
    • Graph theory
    • Weighted clique
    • Weighted graph

    ASJC Scopus subject areas

    • Hardware and Architecture
    • Software
    • Modelling and Simulation

    Cite this

    A DNA-based algorithm for arranging weighted cliques. / Kim, Ikno; Watada, Junzo; Pedrycz, Witold.

    In: Simulation Modelling Practice and Theory, Vol. 16, No. 10, 11.2008, p. 1561-1570.

    Research output: Contribution to journalArticle

    Kim, Ikno ; Watada, Junzo ; Pedrycz, Witold. / A DNA-based algorithm for arranging weighted cliques. In: Simulation Modelling Practice and Theory. 2008 ; Vol. 16, No. 10. pp. 1561-1570.
    @article{1a0245c9cba1496eaaab95bac5034727,
    title = "A DNA-based algorithm for arranging weighted cliques",
    abstract = "A fundamental idea and realization of networks arises in a variety of areas of science and engineering. Their theoretical underpinnings stem from graph theory where numerous fundamental concepts being formulated and solved there have become of immediate interest at the applied side. In this study, our focus is on the weighted maximum clique problem, a highly challenging problem in graph theory. The essence of the problem is to find the nodes with the maximum total of weights in a graph where an edge connects every pair of nodes, meaning every node connects to every other node. We propose an algorithm to find all the weighted cliques as well as the weighted maximum clique in order of size using the framework of DNA computing.",
    keywords = "DNA oligonucleotide, Graph theory, Weighted clique, Weighted graph",
    author = "Ikno Kim and Junzo Watada and Witold Pedrycz",
    year = "2008",
    month = "11",
    doi = "10.1016/j.simpat.2007.11.003",
    language = "English",
    volume = "16",
    pages = "1561--1570",
    journal = "Simulation Modelling Practice and Theory",
    issn = "1569-190X",
    publisher = "Elsevier",
    number = "10",

    }

    TY - JOUR

    T1 - A DNA-based algorithm for arranging weighted cliques

    AU - Kim, Ikno

    AU - Watada, Junzo

    AU - Pedrycz, Witold

    PY - 2008/11

    Y1 - 2008/11

    N2 - A fundamental idea and realization of networks arises in a variety of areas of science and engineering. Their theoretical underpinnings stem from graph theory where numerous fundamental concepts being formulated and solved there have become of immediate interest at the applied side. In this study, our focus is on the weighted maximum clique problem, a highly challenging problem in graph theory. The essence of the problem is to find the nodes with the maximum total of weights in a graph where an edge connects every pair of nodes, meaning every node connects to every other node. We propose an algorithm to find all the weighted cliques as well as the weighted maximum clique in order of size using the framework of DNA computing.

    AB - A fundamental idea and realization of networks arises in a variety of areas of science and engineering. Their theoretical underpinnings stem from graph theory where numerous fundamental concepts being formulated and solved there have become of immediate interest at the applied side. In this study, our focus is on the weighted maximum clique problem, a highly challenging problem in graph theory. The essence of the problem is to find the nodes with the maximum total of weights in a graph where an edge connects every pair of nodes, meaning every node connects to every other node. We propose an algorithm to find all the weighted cliques as well as the weighted maximum clique in order of size using the framework of DNA computing.

    KW - DNA oligonucleotide

    KW - Graph theory

    KW - Weighted clique

    KW - Weighted graph

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

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

    U2 - 10.1016/j.simpat.2007.11.003

    DO - 10.1016/j.simpat.2007.11.003

    M3 - Article

    VL - 16

    SP - 1561

    EP - 1570

    JO - Simulation Modelling Practice and Theory

    JF - Simulation Modelling Practice and Theory

    SN - 1569-190X

    IS - 10

    ER -