Universiti Teknologi Malaysia Institutional Repository

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

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

Full text not available from this repository.

Official URL: http://www.springerlink.com/content/5c97y7qktqhj6c...

Abstract

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.

Item Type:Book Section
Additional Information:ISBN: 3-540-24127-2 ; 1st International Symposium oncomputational and Information Science; 16-18 Dec. 2004, Shanghai, China.
Uncontrolled Keywords:DNA computing, parameter, lower bound, direct proportional length
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions:Computer Science and Information System (Formerly known)
ID Code:7164
Deposited By: Surayahani Abu Bakar
Deposited On:20 Jan 2009 07:35
Last Modified:09 Mar 2011 04:45

Repository Staff Only: item control page