Hybridization-ligation versus parallel overlap assembly: an experimental comparison of initial pool generation for direct-proportional length-based DNA computing

Previously, direct-proportional length-based DNA computing (DPLB-DNAC) for solving weighted graph problems has been reported. The proposed DPLB-DNAC has been successfully applied to solve the shortest path problem, which is an instance of weighted graph problems. The design and development of DPLB-D...

Full description

Saved in:
Bibliographic Details
Main Authors: Ibrahim, Zuwairie, Tsuboi, Yusei, Ono, Osamu
Format: Article
Language:English
Published: Institute of Electrical and Electronics Engineers 2006
Subjects:
Online Access:http://eprints.utm.my/id/eprint/1881/1/01637451_IR8.pdf
http://eprints.utm.my/id/eprint/1881/
http://dx.doi.org/10.1109/TNB.2006.875043
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.utm.1881
record_format eprints
spelling my.utm.18812010-06-01T02:59:14Z http://eprints.utm.my/id/eprint/1881/ Hybridization-ligation versus parallel overlap assembly: an experimental comparison of initial pool generation for direct-proportional length-based DNA computing Ibrahim, Zuwairie Tsuboi, Yusei Ono, Osamu TK Electrical engineering. Electronics Nuclear engineering Previously, direct-proportional length-based DNA computing (DPLB-DNAC) for solving weighted graph problems has been reported. The proposed DPLB-DNAC has been successfully applied to solve the shortest path problem, which is an instance of weighted graph problems. The design and development of DPLB-DNAC is important in order to extend the capability of DNA computing for solving numerical optimization problem. According to DPLB-DNAC, after the initial pool generation, the initial solution is subjected to amplification by polymerase chain reaction and, finally, the output of the computation is visualized by gel electrophoresis. In this paper, however, we give more attention to the initial pool generation of DPLB-DNAC. For this purpose, two kinds of initial pool generation methods, which are generally used for solving weighted graph problems, are evaluated. Those methods are hybridization-ligation and parallel overlap assembly (POA). It is found that for DPLB-DNAC, POA is better than that of the hybridization-ligation method, in terms of population size, generation time, material usage, and efficiency, as supported by the results of actual experiments. Institute of Electrical and Electronics Engineers 2006-06 Article PeerReviewed application/pdf en http://eprints.utm.my/id/eprint/1881/1/01637451_IR8.pdf Ibrahim, Zuwairie and Tsuboi, Yusei and Ono, Osamu (2006) Hybridization-ligation versus parallel overlap assembly: an experimental comparison of initial pool generation for direct-proportional length-based DNA computing. IEEE Transactions on NanoBioscience , 5 (2). pp. 103-109. ISSN 1536-1241 http://dx.doi.org/10.1109/TNB.2006.875043 10.1109/TNB.2006.875043
institution Universiti Teknologi Malaysia
building UTM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Malaysia
content_source UTM Institutional Repository
url_provider http://eprints.utm.my/
language English
topic TK Electrical engineering. Electronics Nuclear engineering
spellingShingle TK Electrical engineering. Electronics Nuclear engineering
Ibrahim, Zuwairie
Tsuboi, Yusei
Ono, Osamu
Hybridization-ligation versus parallel overlap assembly: an experimental comparison of initial pool generation for direct-proportional length-based DNA computing
description Previously, direct-proportional length-based DNA computing (DPLB-DNAC) for solving weighted graph problems has been reported. The proposed DPLB-DNAC has been successfully applied to solve the shortest path problem, which is an instance of weighted graph problems. The design and development of DPLB-DNAC is important in order to extend the capability of DNA computing for solving numerical optimization problem. According to DPLB-DNAC, after the initial pool generation, the initial solution is subjected to amplification by polymerase chain reaction and, finally, the output of the computation is visualized by gel electrophoresis. In this paper, however, we give more attention to the initial pool generation of DPLB-DNAC. For this purpose, two kinds of initial pool generation methods, which are generally used for solving weighted graph problems, are evaluated. Those methods are hybridization-ligation and parallel overlap assembly (POA). It is found that for DPLB-DNAC, POA is better than that of the hybridization-ligation method, in terms of population size, generation time, material usage, and efficiency, as supported by the results of actual experiments.
format Article
author Ibrahim, Zuwairie
Tsuboi, Yusei
Ono, Osamu
author_facet Ibrahim, Zuwairie
Tsuboi, Yusei
Ono, Osamu
author_sort Ibrahim, Zuwairie
title Hybridization-ligation versus parallel overlap assembly: an experimental comparison of initial pool generation for direct-proportional length-based DNA computing
title_short Hybridization-ligation versus parallel overlap assembly: an experimental comparison of initial pool generation for direct-proportional length-based DNA computing
title_full Hybridization-ligation versus parallel overlap assembly: an experimental comparison of initial pool generation for direct-proportional length-based DNA computing
title_fullStr Hybridization-ligation versus parallel overlap assembly: an experimental comparison of initial pool generation for direct-proportional length-based DNA computing
title_full_unstemmed Hybridization-ligation versus parallel overlap assembly: an experimental comparison of initial pool generation for direct-proportional length-based DNA computing
title_sort hybridization-ligation versus parallel overlap assembly: an experimental comparison of initial pool generation for direct-proportional length-based dna computing
publisher Institute of Electrical and Electronics Engineers
publishDate 2006
url http://eprints.utm.my/id/eprint/1881/1/01637451_IR8.pdf
http://eprints.utm.my/id/eprint/1881/
http://dx.doi.org/10.1109/TNB.2006.875043
_version_ 1643643441617305600
score 13.15806