DNA-based evolutionary algorithm for cable trench problem

Don Jyh Fu Jeng; Ikno Kim; Junzo Watada

DNA-based evolutionary algorithm for cable trench problem

Don Jyh Fu Jeng^*, Ikno Kim, Junzo Watada

^*Corresponding author for this work

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

7 Citations (Scopus)

Abstract

An evolutionary DNA computing algorithm is proposed for solving a cable trench problem in this paper. The cable trench problem is a combination of the shortest path and minimum spanning tree problems, which makes it difficult to be solved by conventional computing method. DNA computing is applied to overcome the limitation, where fixed-length DNA strands are used in representing numerical values and the weights are varied by melting temperatures. Biochemical techniques in terms of DNA thermodynamic properties are used for effective local search of the optimal solution.

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages	922-929
Number of pages	8
Volume	4253 LNAI - III
Publication status	Published - 2006
Event	10th International Conference on Knowledge-Based Intelligent Information and Engineering Systems, KES 2006 - Bournemouth Duration: 2006 Oct 9 → 2006 Oct 11

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4253 LNAI - III
ISSN (Print)	03029743
ISSN (Electronic)	16113349

Other

Other	10th International Conference on Knowledge-Based Intelligent Information and Engineering Systems, KES 2006
City	Bournemouth
Period	06/10/9 → 06/10/11

ASJC Scopus subject areas

Computer Science(all)
Biochemistry, Genetics and Molecular Biology(all)
Theoretical Computer Science

Cite this

Jeng, D. J. F., Kim, I., & Watada, J. (2006). DNA-based evolutionary algorithm for cable trench problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4253 LNAI - III, pp. 922-929). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4253 LNAI - III).

DNA-based evolutionary algorithm for cable trench problem. / Jeng, Don Jyh Fu; Kim, Ikno; Watada, Junzo.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4253 LNAI - III 2006. p. 922-929 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4253 LNAI - III).

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

Jeng, DJF, Kim, I & Watada, J 2006, DNA-based evolutionary algorithm for cable trench problem. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4253 LNAI - III, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4253 LNAI - III, pp. 922-929, 10th International Conference on Knowledge-Based Intelligent Information and Engineering Systems, KES 2006, Bournemouth, 06/10/9.

Jeng DJF, Kim I, Watada J. DNA-based evolutionary algorithm for cable trench problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4253 LNAI - III. 2006. p. 922-929. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

Jeng, Don Jyh Fu ; Kim, Ikno ; Watada, Junzo. / DNA-based evolutionary algorithm for cable trench problem. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4253 LNAI - III 2006. pp. 922-929 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{046c9252d6da434a941db7f9c6a7f149,

title = "DNA-based evolutionary algorithm for cable trench problem",

abstract = "An evolutionary DNA computing algorithm is proposed for solving a cable trench problem in this paper. The cable trench problem is a combination of the shortest path and minimum spanning tree problems, which makes it difficult to be solved by conventional computing method. DNA computing is applied to overcome the limitation, where fixed-length DNA strands are used in representing numerical values and the weights are varied by melting temperatures. Biochemical techniques in terms of DNA thermodynamic properties are used for effective local search of the optimal solution.",

author = "Jeng, {Don Jyh Fu} and Ikno Kim and Junzo Watada",

year = "2006",

language = "English",

isbn = "3540465421",

volume = "4253 LNAI - III",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "922--929",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

note = "10th International Conference on Knowledge-Based Intelligent Information and Engineering Systems, KES 2006 ; Conference date: 09-10-2006 Through 11-10-2006",

}

TY - GEN

T1 - DNA-based evolutionary algorithm for cable trench problem

AU - Jeng, Don Jyh Fu

AU - Kim, Ikno

AU - Watada, Junzo

PY - 2006

Y1 - 2006

N2 - An evolutionary DNA computing algorithm is proposed for solving a cable trench problem in this paper. The cable trench problem is a combination of the shortest path and minimum spanning tree problems, which makes it difficult to be solved by conventional computing method. DNA computing is applied to overcome the limitation, where fixed-length DNA strands are used in representing numerical values and the weights are varied by melting temperatures. Biochemical techniques in terms of DNA thermodynamic properties are used for effective local search of the optimal solution.

AB - An evolutionary DNA computing algorithm is proposed for solving a cable trench problem in this paper. The cable trench problem is a combination of the shortest path and minimum spanning tree problems, which makes it difficult to be solved by conventional computing method. DNA computing is applied to overcome the limitation, where fixed-length DNA strands are used in representing numerical values and the weights are varied by melting temperatures. Biochemical techniques in terms of DNA thermodynamic properties are used for effective local search of the optimal solution.

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

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

M3 - Conference contribution

AN - SCOPUS:33750721405

SN - 3540465421

SN - 9783540465423

VL - 4253 LNAI - III

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 922

EP - 929

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

T2 - 10th International Conference on Knowledge-Based Intelligent Information and Engineering Systems, KES 2006

Y2 - 9 October 2006 through 11 October 2006

ER -

DNA-based evolutionary algorithm for cable trench problem

Abstract

Publication series

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this