Skip to main content
SpringerLink
Log in

A Study on Lower Bound of Direct Proportional Length-Based DNA Computing for Shortest Path Problem

  • Conference paper
Computational and Information Science (CIS 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3314))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adleman, L.: Molecular Computation of Solutions to Combinatorial Problems. Science 266, 1021–1024 (1994)

    Article  Google Scholar 

  2. Ibrahim, Z., Ono, O., Tsuboi, Y., Khalid, M.: Length-Based DNA Computing for 1-Pair Shortest Path Problem. In: Proc. of the Ninth International Symposium on Artificial Life and Robotics, pp. 299–302 (2004)

    Google Scholar 

  3. Lee, J.Y., Shin, S.Y., Augh, S.J., Park, T.H., Zhang, B.T.: Temperature Gradient-Based DNA Computing for Graph Problems with Weighted Edges. In: Hagiya, M., Ohuchi, A. (eds.) DNA 2002. LNCS, vol. 2568, pp. 73–84. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Narayanan, A., Zorbalas, S.: DNA Algorithms for Computing Shortest Paths. In: Proceedings of Genetic Programming, pp. 718–723 (1998)

    Google Scholar 

  5. Udo, F., Sam, S., Wolfgang, B., Hilmar, R.: DNA Sequence Generator: A Program for the Construction of DNA Sequences. In: Jonoska, N., Seeman, N.C. (eds.) Proceedings of the Seventh International Workshop on DNA Based Computers, pp. 23–32 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Applied DNA Computing, Meiji University, 1-1-1 Higashi-mita, Tama-ku, Kawasaki-shi, Kanagawa-ken, 214-8571, Japan

    Zuwairie Ibrahim, Yusei Tsuboi & Osamu Ono

  2. Center for Artificial Intelligence and Robotics (CAIRO), Universiti Teknologi Malaysia, Jalan Semarak, 54100, Kuala Lumpur, Malaysia

    Marzuki Khalid

Authors
  1. Zuwairie Ibrahim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yusei Tsuboi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Osamu Ono
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Marzuki Khalid
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Electronic Science and Technology, Anhui University, Hefei, Anhui, China

    Jun Zhang

  2. College of Science, Donghua University, 1882 Yan’an Xilu Road, 20051, Shanghai, China

    Ji-Huan He

  3. BASICS, Department of Computer Science and Engineering, Shanghai Jiao Tong University, 200030, Shanghai, China

    Yuxi Fu

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ibrahim, Z., Tsuboi, Y., Ono, O., Khalid, M. (2004). A Study on Lower Bound of Direct Proportional Length-Based DNA Computing for Shortest Path Problem. In: Zhang, J., He, JH., Fu, Y. (eds) Computational and Information Science. CIS 2004. Lecture Notes in Computer Science, vol 3314. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30497-5_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30497-5_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24127-0

  • Online ISBN: 978-3-540-30497-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation