DNA computing of solutions to knapsack problems
作者： Christiaan V. Henkel , Thomas Bäck , Joost N. Kok , Grzegorz Rozenberg , Herman P. Spaink
DOI: 10.1016/J.BIOSYSTEMS.2006.06.001
关键词: Line (geometry) 、 Volume (computing) 、 Continuous knapsack problem 、 Computation 、 Knapsack problem 、 DNA computing 、 Mathematics 、 Theoretical computer science 、 Optimization problem 、 Polynomial-time approximation scheme
摘要: … This combination of DNA and protein allows for multi-criterion optimization. The … of knapsack problems using plasmids. These problems ask for the best way to pack a knapsack of …
elsevier.com
sci-hub.se 参考文章(18)
Przemyslaw Prusinkiewicz, Alessandra Carbone, Mikhael Gromov, Pattern formation in biology, vision and dynamics ,(2000)
Christiaan V. Henkel, Joost N. Kok, Towards Evolutionary DNA Computing Lecture Notes in Computer Science. pp. 242- 257 ,(2005) , 10.1007/11499220_26
Tom Head, Xia Chen, Matthew J. Nichols, Masayuki Yamamura, Susannah Gal, Aqueous Solutions of Algorithmic Problems: Emphasizing Knights on a 3 x 3 international workshop on dna based computers. pp. 191- 202 ,(2001) , 10.1007/3-540-48017-X_18
Thomas Bäck, Joost N. Kok, Grzegorz Rozenberg, Evolutionary Computation as a Paradigm for DNA-Based Computing Natural Computing Series. pp. 15- 40 ,(2002) , 10.1007/978-3-642-55606-7_2
Gheorghe Paun, Arto Salomaa, Grzegorz Rozenberg, DNA Computing: New Computing Paradigms ,(1998)
E. Stoschek, M. Sturm, T. Hinze, DNA-Computing – ein funktionales Modell im laborpraktischen Experiment Informatik - Forschung Und Entwicklung. ,vol. 16, pp. 35- 52 ,(2001) , 10.1007/PL00009141
Vieira Jeffrey, Messing Joachim, New pUC-derived cloning vectors with different selectable markers and DNA replication origins. Gene. ,vol. 100, pp. 189- 194 ,(1991) , 10.1016/0378-1119(91)90365-I
Katsuyuki Tanizawa, Kozo Kinoshita, Hiroshi Iwasaki, Yohei Aoi, Tatsuo Yoshinobu, Solution of the Knapsack Problem by Deoxyribonucleic Acid Computing Japanese Journal of Applied Physics. ,vol. 37, pp. 5839- 5841 ,(1998) , 10.1143/JJAP.37.5839
Michael R. Garey, David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness ,(1979)
Weng-Long Chang, Michael (Shan-Hui) Ho, Minyi Guo, Molecular solutions for the subset-sum problem on DNA-based supercomputing. BioSystems. ,vol. 73, pp. 117- 130 ,(2004) , 10.1016/J.BIOSYSTEMS.2003.11.001