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

  • Authors:
  • Zuwairie Ibrahim;Yusei Tsuboi;Osamu Ono;Marzuki Khalid

  • Affiliations:
  • Institute of Applied DNA Computing, Meiji University, Kanagawa-ken, Japan;Institute of Applied DNA Computing, Meiji University, Kanagawa-ken, Japan;Institute of Applied DNA Computing, Meiji University, Kanagawa-ken, Japan;Center for Artificial Intelligence and Robotics (CAIRO), Universiti Teknologi Malaysia, Kuala Lumpur, Malaysia

  • Venue:
  • CIS'04 Proceedings of the First international conference on Computational and Information Science
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

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.