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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adleman, L.: Molecular Computation of Solutions to Combinatorial Problems. Science 266, 1021–1024 (1994)
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)
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)
Narayanan, A., Zorbalas, S.: DNA Algorithms for Computing Shortest Paths. In: Proceedings of Genetic Programming, pp. 718–723 (1998)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)