A DNA encoding method to determine and sequence all cliques in a weighted graph

Ikno Kim; Junzo Watada; Jui Yu Wu

doi:10.1109/ICICIC.2009.10

A DNA encoding method to determine and sequence all cliques in a weighted graph

Ikno Kim, Junzo Watada, Jui Yu Wu

Department of Biochemistry and Molecular Cell Biology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Citation (Scopus)

Abstract

In many aspects of advanced applied information technology, science, and bioinformatics, having theoretical concepts based on graph theory provides an important way to create or develop new hybrids, combined information, and intelligent techniques or methods. Finding the maximum weighted clique problem can be a significant issue and concept in graph theory. Meanwhile, encoding biological codes, represented as biological sequence information, is an important process in executing biological computations. In this paper, we focus on a way of encoding biological sequences to create a new encoding method particularly designed to solve clique problems in a weighted graph.

Original language	English
Title of host publication	2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009
Pages	1532-1537
Number of pages	6
DOIs	https://doi.org/10.1109/ICICIC.2009.10
Publication status	Published - 2009
Event	2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009 - Kaohsiung, Taiwan Duration: Dec 7 2009 → Dec 9 2009

Other

Other	2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009
Country/Territory	Taiwan
City	Kaohsiung
Period	12/7/09 → 12/9/09

Keywords

Bio-inspired computation
DNA encoding method
Weighted clique
Weighted graph

ASJC Scopus subject areas

Computational Theory and Mathematics
Computer Networks and Communications
Software

Access to Document

10.1109/ICICIC.2009.10

Cite this

Kim, I, Watada, J & Wu, JY 2009, A DNA encoding method to determine and sequence all cliques in a weighted graph. in 2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009., 5412282, pp. 1532-1537, 2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009, Kaohsiung, Taiwan, 12/7/09. https://doi.org/10.1109/ICICIC.2009.10

@inproceedings{46f3d06293e24cb0b76c368de5a68d8a,

title = "A DNA encoding method to determine and sequence all cliques in a weighted graph",

abstract = "In many aspects of advanced applied information technology, science, and bioinformatics, having theoretical concepts based on graph theory provides an important way to create or develop new hybrids, combined information, and intelligent techniques or methods. Finding the maximum weighted clique problem can be a significant issue and concept in graph theory. Meanwhile, encoding biological codes, represented as biological sequence information, is an important process in executing biological computations. In this paper, we focus on a way of encoding biological sequences to create a new encoding method particularly designed to solve clique problems in a weighted graph.",

keywords = "Bio-inspired computation, DNA encoding method, Weighted clique, Weighted graph",

author = "Ikno Kim and Junzo Watada and Wu, {Jui Yu}",

year = "2009",

doi = "10.1109/ICICIC.2009.10",

language = "English",

isbn = "9780769538730",

pages = "1532--1537",

booktitle = "2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009",

note = "2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009 ; Conference date: 07-12-2009 Through 09-12-2009",

}

TY - GEN

T1 - A DNA encoding method to determine and sequence all cliques in a weighted graph

AU - Kim, Ikno

AU - Watada, Junzo

AU - Wu, Jui Yu

PY - 2009

Y1 - 2009

N2 - In many aspects of advanced applied information technology, science, and bioinformatics, having theoretical concepts based on graph theory provides an important way to create or develop new hybrids, combined information, and intelligent techniques or methods. Finding the maximum weighted clique problem can be a significant issue and concept in graph theory. Meanwhile, encoding biological codes, represented as biological sequence information, is an important process in executing biological computations. In this paper, we focus on a way of encoding biological sequences to create a new encoding method particularly designed to solve clique problems in a weighted graph.

AB - In many aspects of advanced applied information technology, science, and bioinformatics, having theoretical concepts based on graph theory provides an important way to create or develop new hybrids, combined information, and intelligent techniques or methods. Finding the maximum weighted clique problem can be a significant issue and concept in graph theory. Meanwhile, encoding biological codes, represented as biological sequence information, is an important process in executing biological computations. In this paper, we focus on a way of encoding biological sequences to create a new encoding method particularly designed to solve clique problems in a weighted graph.

KW - Bio-inspired computation

KW - DNA encoding method

KW - Weighted clique

KW - Weighted graph

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

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

U2 - 10.1109/ICICIC.2009.10

DO - 10.1109/ICICIC.2009.10

M3 - Conference contribution

AN - SCOPUS:77951445679

SN - 9780769538730

SP - 1532

EP - 1537

BT - 2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009

T2 - 2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009

Y2 - 7 December 2009 through 9 December 2009

ER -

A DNA encoding method to determine and sequence all cliques in a weighted graph

Abstract

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this