A DNA-based algorithm for arranging weighted cliques

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, o...

Full description

Saved in:
Bibliographic Details
Published inSimulation Modelling Practice and Theory Vol. 16; no. 10; pp. 1561 - 1570
Main Authors Kim, Ikno, Watada, Junzo, Pedrycz, Witold
Format Journal Article
LanguageEnglish
Japanese
Published Elsevier B.V 01.11.2008
Elsevier BV
Subjects
DNA oligonucleotide
Graph theory
Weighted clique
Weighted graph
Weighted clique
Graph theory
DNA oligonucleotide
Weighted graph
Online AccessGet full text
ISSN1569-190X
1878-1462
DOI10.1016/j.simpat.2007.11.003

Cover

More Information
Summary: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.
ISSN:1569-190X
1878-1462
DOI:10.1016/j.simpat.2007.11.003