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...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Book Section |
| Published: |
Springer
2005
|
| Subjects: |
| _version_ | 1825909998817902592 |
|---|---|
| author | Ibrahim, Zuwairie Tsuboi, Yusei Ono, Osamu Khalid, Marzuki |
| author2 | Zhang, J. |
| author_facet | Zhang, J. Ibrahim, Zuwairie Tsuboi, Yusei Ono, Osamu Khalid, Marzuki |
| author_sort | Ibrahim, Zuwairie |
| collection | ePrints |
| 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.
|
| first_indexed | 2024-03-05T18:10:31Z |
| format | Book Section |
| id | utm.eprints-7164 |
| institution | Universiti Teknologi Malaysia - ePrints |
| last_indexed | 2024-03-05T18:10:31Z |
| publishDate | 2005 |
| publisher | Springer |
| record_format | dspace |
| spelling | utm.eprints-71642017-07-25T06:16:59Z http://eprints.utm.my/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 |
| 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 |
| title | 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_short | 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 |
| topic | QA75 Electronic computers. Computer science |
| work_keys_str_mv | AT ibrahimzuwairie astudyonlowerboundofdirectproportionallengthbaseddnacomputingforshortestpathproblem AT tsuboiyusei astudyonlowerboundofdirectproportionallengthbaseddnacomputingforshortestpathproblem AT onoosamu astudyonlowerboundofdirectproportionallengthbaseddnacomputingforshortestpathproblem AT khalidmarzuki astudyonlowerboundofdirectproportionallengthbaseddnacomputingforshortestpathproblem AT ibrahimzuwairie studyonlowerboundofdirectproportionallengthbaseddnacomputingforshortestpathproblem AT tsuboiyusei studyonlowerboundofdirectproportionallengthbaseddnacomputingforshortestpathproblem AT onoosamu studyonlowerboundofdirectproportionallengthbaseddnacomputingforshortestpathproblem AT khalidmarzuki studyonlowerboundofdirectproportionallengthbaseddnacomputingforshortestpathproblem |