Cover Image

A study on lower bound of direct proportional length-based DNA computing for shortest path problem

Previously, we proposed a direct proportional length-based DNA computing approach for weighted graph problem. The approach has been proposed essentially to overcome the shortcoming of constant proportional length-based DNA computing approach. However, by using this approach, the minimum weight of ed...

Full description

Saved in:
Bibliographic Details
Main Authors: Ibrahim, Zuwairie, Tsuboi, Yusei, Ono, Osamu, Khalid, Marzuki
Other Authors: Zhang, J.
Format: Book Section
Published: Springer 2005
Subjects:
QA75 Electronic computers. Computer science
Online Access:http://eprints.utm.my/id/eprint/7164/
https://link.springer.com/chapter/10.1007/978-3-540-30497-5_12
http://dx.doi.org/10.1007/b104566
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.utm.7164
record_format eprints
spelling my.utm.71642017-07-25T06:16:59Z http://eprints.utm.my/id/eprint/7164/ A study on lower bound of direct proportional length-based DNA computing for shortest path problem Ibrahim, Zuwairie Tsuboi, Yusei Ono, Osamu Khalid, Marzuki QA75 Electronic computers. Computer science Previously, we proposed a direct proportional length-based DNA computing approach for weighted graph problem. The approach has been proposed essentially to overcome the shortcoming of constant proportional length-based DNA computing approach. However, by using this approach, the minimum weight of edges that can be encoded is limited. Hence, in this paper, the lower bound, in term of minimum weight that can be encoded by direct proportional length-based DNA computing is analyzed. Also, the parameters contribute to the lower bound are investigated in order to identify the relation between those parameters and the lower bound of the direct proportional length-based DNA computing approach. Springer Zhang, J. He, J.H. Fu, Y. 2005 Book Section PeerReviewed Ibrahim, Zuwairie and Tsuboi, Yusei and Ono, Osamu and Khalid, Marzuki (2005) A study on lower bound of direct proportional length-based DNA computing for shortest path problem. In: Computational and Information Science. Lecture Notes in Computer Science, 3314/2005 . Springer, Berlin / Heidelberg, pp. 71-76. ISBN 978-3-540-24127-0 https://link.springer.com/chapter/10.1007/978-3-540-30497-5_12 http://dx.doi.org/10.1007/b104566
institution Universiti Teknologi Malaysia
building UTM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Malaysia
content_source UTM Institutional Repository
url_provider http://eprints.utm.my/
topic QA75 Electronic computers. Computer science
spellingShingle QA75 Electronic computers. Computer science
Ibrahim, Zuwairie
Tsuboi, Yusei
Ono, Osamu
Khalid, Marzuki
A study on lower bound of direct proportional length-based DNA computing for shortest path problem
description Previously, we proposed a direct proportional length-based DNA computing approach for weighted graph problem. The approach has been proposed essentially to overcome the shortcoming of constant proportional length-based DNA computing approach. However, by using this approach, the minimum weight of edges that can be encoded is limited. Hence, in this paper, the lower bound, in term of minimum weight that can be encoded by direct proportional length-based DNA computing is analyzed. Also, the parameters contribute to the lower bound are investigated in order to identify the relation between those parameters and the lower bound of the direct proportional length-based DNA computing approach.
author2 Zhang, J.
author_facet Zhang, J.
Ibrahim, Zuwairie
Tsuboi, Yusei
Ono, Osamu
Khalid, Marzuki
format Book Section
author Ibrahim, Zuwairie
Tsuboi, Yusei
Ono, Osamu
Khalid, Marzuki
author_sort Ibrahim, Zuwairie
title A study on lower bound of direct proportional length-based DNA computing for shortest path problem
title_short A study on lower bound of direct proportional length-based DNA computing for shortest path problem
title_full A study on lower bound of direct proportional length-based DNA computing for shortest path problem
title_fullStr A study on lower bound of direct proportional length-based DNA computing for shortest path problem
title_full_unstemmed A study on lower bound of direct proportional length-based DNA computing for shortest path problem
title_sort study on lower bound of direct proportional length-based dna computing for shortest path problem
publisher Springer
publishDate 2005
url http://eprints.utm.my/id/eprint/7164/
https://link.springer.com/chapter/10.1007/978-3-540-30497-5_12
http://dx.doi.org/10.1007/b104566
_version_ 1643644713601859584
score 13.211869

Similar Items