Hybrid concentration-controlled direct-proportional length-based DNA computing for numerical optimization of the shortest path problem

• Main Authors: Ibrahim, Zuwairie, Tsuboi, Yusei, Ono, Osamu, Khalid, Marzuki
• Other Authors: Ijspeert, A. J.
• Format: Book Section
• Published: Springer 2006
• Subjects: QA75 Electronic computers. Computer science
• Online Access: http://eprints.utm.my/id/eprint/7188/; https://link.springer.com/chapter/10.1007%2F11613022_18

DNA computing often makes use of hybridization, whether for vastly generating the initial candidate answers or amplification by using polymerase chain reaction (PCR). The main idea behind DNA computing approaches for solving weighted graph problems is that if the degree of hybridization can be controlled, then it is able to generate more double stranded DNAs (dsDNAs), which represent the answer of the problem during in vitro computation. Previously, length, concentration, and melting temperature, have been exploited for encoding of weights of a weighted graph problem. In this paper, we present a hybrid approach, which is called concentration-controlled direct-proportional length-based DNA computing (CCDPLB-DNAC), that combines two characteristics: length and concentration, for encoding and at the same time, effectively control the degree of hybridization of DNA. The encoding by length is realized whereby the cost of each path is encoded by the length of the oligonucleotides (oligos) in a proportional way. On the other hand, the hybridization control by concentration is done by varying the amount of oligos, as the input of computation, before the computation begins. The advantage is such that, after an initial pool generation and amplification, polyacrylamide gel electrophoresis (PAGE) can be performed to separate the survived dsDNAs according to their length, which directly decodes the results. The proposed approach shows significant improvement in term of materials used and scalability. The experimental results show the effectiveness of the proposed CCDPLB-DNAC for solving weighted graph problems, such as the shortest path problem.