{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T19:32:05Z","timestamp":1729625525473,"version":"3.28.0"},"reference-count":29,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/cec.2005.1554752","type":"proceedings-article","created":{"date-parts":[[2005,12,13]],"date-time":"2005-12-13T20:55:52Z","timestamp":1134507352000},"page":"707-713","source":"Crossref","is-referenced-by-count":5,"title":["DNA Implementation of k-shortest Paths Computation"],"prefix":"10.1109","volume":"1","author":[{"given":"Z.","family":"Ibrahim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.","family":"Tsuboi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.S.","family":"Muhammad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"O.","family":"Ono","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Khalid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03563-4"},{"key":"17","article-title":"A comparative study of classical algorithms and new approaches for the search of the K best paths in a graph","volume":"dsic ii 28 92","author":"marzal","year":"1992","journal-title":"Technical Report"},{"key":"18","first-page":"718","article-title":"DNA algorithms for computing shortest paths","author":"narayanan","year":"1998","journal-title":"Proceedings of Genetic Programming"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/11493785_19"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/j.biosystems.2004.06.005"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1006\/jtbi.1997.0475"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36440-4_7"},{"key":"11","doi-asserted-by":"crossref","first-page":"4084","DOI":"10.1073\/pnas.88.10.4084","article-title":"Polymerase chain reaction-mediated gene synthesis: Synthesis of a gene coding for isozymec of horseradish peroxidase","volume":"88","author":"jayaraman","year":"1991","journal-title":"Proc Natl Acad Sci U S A"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230120406"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1287\/opre.9.4.578"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48017-X_4"},{"key":"22","doi-asserted-by":"crossref","first-page":"10747","DOI":"10.1073\/pnas.91.22.10747","article-title":"DNA shuffling by random fragmentation and reassembly: In vitro re-combination for molecular evolution","volume":"91","author":"stemmer","year":"1994","journal-title":"Proc Natl Acad Sci U S A"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1016\/0378-1119(95)00511-4"},{"journal-title":"Routing Algorithms for Dynamic Intelligent Transportation Networks","year":"1997","author":"subramaniam","key":"24"},{"key":"25","first-page":"23","article-title":"DNA sequence generator: A program for the construction of DNA sequences","author":"udo","year":"2001","journal-title":"Proceedings of the Seventh International Workshop on DNA Based Computers"},{"key":"26","first-page":"466","article-title":"DNA solution of the shortest path problem by concentration control","author":"yamamoto","year":"2000","journal-title":"Genome Informatics"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037359"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1142\/S1469026802000750"},{"journal-title":"DNA Based Computational Models","year":"2000","author":"zucca","key":"29"},{"journal-title":"Computing with Cell and Atoms An Introduction to Quantum DNA and Membrane Computing","year":"2001","author":"calude","key":"3"},{"key":"2","first-page":"34","author":"adleman","year":"1998","journal-title":"Computing with DNA"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/320998.321004"},{"key":"1","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1126\/science.7973651","article-title":"Molecular computation of solutions to combinatorial problems","volume":"266","author":"adleman","year":"1994","journal-title":"Science"},{"key":"7","article-title":"K-th shortest paths and applications to the probabilistic networks","volume":"23","author":"fox","year":"1975","journal-title":"ORSA\/TIMS Joint Nat Meeting"},{"key":"6","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1109\/SFCS.1994.365697","article-title":"Finding the k shortest path","author":"eppstein","year":"1994","journal-title":"IEEE Symposium on Foundations of Computer Science"},{"key":"5","doi-asserted-by":"crossref","first-page":"906","DOI":"10.1007\/BF01952607","article-title":"PCR jumping in cones of 30-million-year-old DNA fagments from amber preserved termites","volume":"49","author":"desalle","year":"1993","journal-title":"Experientia"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/ICII.2001.982778"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/0378-1119(89)90358-2"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.3.CO;2-T"}],"event":{"name":"2005 IEEE Congress on Evolutionary Computation","location":"Edinburgh, Scotland, UK"},"container-title":["2005 IEEE Congress on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10417\/33079\/01554752.pdf?arnumber=1554752","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,17]],"date-time":"2017-06-17T01:42:00Z","timestamp":1497663720000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1554752\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/cec.2005.1554752","relation":{},"subject":[]}}