Warning: The NCBI web site requires JavaScript to function. more...
Solving a Hamiltonian Path Problem with a bacterial computer.
Baumgardner J, Acker K, Adefuye O, Crowley ST, Deloache W, Dickson JO, Heard L, Martens AT, Morton N, Ritter M, Shoecraft A, Treece J, Unzicker M, Valencia A, Waters M, Campbell AM, Heyer LJ, Poet JL, Eckdahl TT.
J Biol Eng. 2009 Jul 24;3:11.
Related citations
DNA computing the Hamiltonian path problem.
Lee CM, Kim SW, Kim SM, Sohn U.
Mol Cells. 1999 Oct 31;9(5):464-9.
DNA computing on surfaces.
Liu Q, Wang L, Frutos AG, Condon AE, Corn RM, Smith LM.
Nature. 2000 Jan 13;403(6766):175-9.
Demonstration of a universal surface DNA computer.
Su X, Smith LM.
Nucleic Acids Res. 2004 Jun 4;32(10):3115-23. Print 2004.
DNA polymerase programmed with a hairpin DNA incorporates a multiple-instruction architecture into molecular computing.
Komiya K, Sakamoto K, Kameda A, Yamamoto M, Ohuchi A, Kiga D, Yokoyama S, Hagiya M.
Biosystems. 2006 Jan;83(1):18-25.
An O(2n) volume molecular algorithm for Hamiltonian path.
Fu B, Beigel R, Zhou FX.
Biosystems. 1999 Oct;52(1-3):217-26.
Molecular computation of solutions to combinatorial problems.
Adleman LM.
Science. 1994 Nov 11;266(5187):1021-4.
Is optimal solution of every NP-complete or NP-hard problem determined from its characteristic for DNA-based computing.
Guo M, Chang WL, Ho M, Lu J, Cao J.
Biosystems. 2005 Apr;80(1):71-82. Epub 2004 Nov 26.
Dynamic algorithms for the shortest path routing problem: learning automata-based solutions.
Misra S, Oommen BJ.
IEEE Trans Syst Man Cybern B Cybern. 2005 Dec;35(6):1179-92.
Path matching and graph matching in biological networks.
Yang Q, Sze SH.
J Comput Biol. 2007 Jan-Feb;14(1):56-67.
Computational tools for the modern andrologist.
Niederberger C.
J Androl. 1996 Sep-Oct;17(5):462-6. Review.
A parallel graph decomposition algorithm for DNA sequencing with nanopores.
Bokhari SH, Sauer JR.
Bioinformatics. 2005 Apr 1;21(7):889-96. Epub 2004 Nov 11.
A P system and a constructive membrane-inspired DNA algorithm for solving the Maximum Clique Problem.
García-Arnau M, Manrique D, Rodríguez-Patón A, Sosík P.
Biosystems. 2007 Nov-Dec;90(3):687-97. Epub 2007 Feb 23.
Live-wires using path-graphs.
König S, Hesser J.
Methods Inf Med. 2004;43(4):371-5.
Computing paths and cycles in biological interaction graphs.
Klamt S, von Kamp A.
BMC Bioinformatics. 2009 Jun 15;10:181.
Learning graph matching.
Caetano TS, McAuley JJ, Cheng L, Le QV, Smola AJ.
IEEE Trans Pattern Anal Mach Intell. 2009 Jun;31(6):1048-58.
A graph-based evolutionary algorithm: Genetic Network Programming (GNP) and its extension using reinforcement learning.
Mabu S, Hirasawa K, Hu J.
Evol Comput. 2007 Fall;15(3):369-98.
Communication and complexity in a GRN-based multicellular system for graph colouring.
Buck M, Nehaniv CL.
Biosystems. 2008 Oct-Nov;94(1-2):28-33. Epub 2008 Jun 20.
Linking Cytoscape and the corynebacterial reference database CoryneRegNet.
Baumbach J, Apeltsin L.
BMC Genomics. 2008 Apr 21;9:184.
An efficient re-indexing algorithm for color-mapped images.
Battiato S, Gallo G, Impoco G, Stanco F.
IEEE Trans Image Process. 2004 Nov;13(11):1419-23.
Filter your results:
Your browsing activity is empty.
Activity recording is turned off.
Turn recording back on