### Abstract

In this paper, a demonstration of DNA computing for k-shortest paths of a weighted graph is realized by biochemical experiments in such a way that every path is encoded by oligonucleotides and the length of the path is directly proportional to the length of oligonucleotides. For initial pool generation, parallel overlap assembly is employed for efficient generation of all candidate answers. During the computation, after the initial pool of solution is subjected to amplification, which is polymerase chain reaction, k shortest paths could be separated by gel electrophoresis and the selection can be made at last.

Original language | English |
---|---|

Title of host publication | 2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings |

Pages | 707-713 |

Number of pages | 7 |

Publication status | Published - 31 Oct 2005 |

Event | 2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005 - Edinburgh, Scotland, United Kingdom Duration: 2 Sep 2005 → 5 Sep 2005 |

### Publication series

Name | 2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings |
---|---|

Volume | 1 |

### Conference

Conference | 2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005 |
---|---|

Country | United Kingdom |

City | Edinburgh, Scotland |

Period | 2/09/05 → 5/09/05 |

### Fingerprint

### Cite this

*2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings*(pp. 707-713). (2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings; Vol. 1).