132 related articles for article (PubMed ID: 10597033)
1. DNA computing the Hamiltonian path problem.
Lee CM; Kim SW; Kim SM; Sohn U
Mol Cells; 1999 Oct; 9(5):464-9. PubMed ID: 10597033
[TBL] [Abstract][Full Text] [Related]
2. 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; 3():11. PubMed ID: 19630940
[TBL] [Abstract][Full Text] [Related]
3. An O(2n) volume molecular algorithm for Hamiltonian path.
Fu B; Beigel R; Zhou FX
Biosystems; 1999 Oct; 52(1-3):217-26. PubMed ID: 10636047
[TBL] [Abstract][Full Text] [Related]
4. In Vitro Identification of the Hamiltonian Cycle Using a Circular Structure Assisted DNA Computer.
Sharma D; Ramteke M
ACS Comb Sci; 2020 May; 22(5):225-231. PubMed ID: 32212630
[TBL] [Abstract][Full Text] [Related]
5. Solving the 3-SAT problem based on DNA computing.
Liu W; Gao L; Liu X; Wang S; Xu J
J Chem Inf Comput Sci; 2003; 43(6):1872-5. PubMed ID: 14632435
[TBL] [Abstract][Full Text] [Related]
6. Solving the set cover problem and the problem of exact cover by 3-sets in the Adleman-Lipton model.
Chang WL; Guo M
Biosystems; 2003 Dec; 72(3):263-75. PubMed ID: 14643494
[TBL] [Abstract][Full Text] [Related]
7. Molecular computation of solutions to combinatorial problems.
Adleman LM
Science; 1994 Nov; 266(5187):1021-4. PubMed ID: 7973651
[TBL] [Abstract][Full Text] [Related]
8. A novel bio-heuristic computing algorithm to solve the capacitated vehicle routing problem based on Adleman-Lipton model.
Wang Z; Ren X; Ji Z; Huang W; Wu T
Biosystems; 2019 Oct; 184():103997. PubMed ID: 31369836
[TBL] [Abstract][Full Text] [Related]
9. A general resolution of intractable problems in polynomial time through DNA Computing.
Sanches CA; Soma NY
Biosystems; 2016 Dec; 150():119-131. PubMed ID: 27693626
[TBL] [Abstract][Full Text] [Related]
10. Solving the Family Traveling Salesperson Problem in the Adleman-Lipton Model Based on DNA Computing.
Wu X; Wang Z; Wu T; Bao X
IEEE Trans Nanobioscience; 2022 Jan; 21(1):75-85. PubMed ID: 34460379
[TBL] [Abstract][Full Text] [Related]
11. DNA computing on surfaces.
Liu Q; Wang L; Frutos AG; Condon AE; Corn RM; Smith LM
Nature; 2000 Jan; 403(6766):175-9. PubMed ID: 10646598
[TBL] [Abstract][Full Text] [Related]
12. A new algorithm to find fuzzy Hamilton cycle in a fuzzy network using adjacency matrix and minimum vertex degree.
Nagoor Gani A; Latha SR
Springerplus; 2016; 5(1):1854. PubMed ID: 27818892
[TBL] [Abstract][Full Text] [Related]
13. Fractionation, phosphorylation and ligation on oligonucleotide microchips to enhance sequencing by hybridization.
Dubiley S; Kirillov E; Lysov Y; Mirzabekov A
Nucleic Acids Res; 1997 Jun; 25(12):2259-65. PubMed ID: 9171075
[TBL] [Abstract][Full Text] [Related]
14. The bounded complexity of DNA computing.
Garzon MH; Jonoska N; Karl SA
Biosystems; 1999 Oct; 52(1-3):63-72. PubMed ID: 10636031
[TBL] [Abstract][Full Text] [Related]
15. Demonstration of a universal surface DNA computer.
Su X; Smith LM
Nucleic Acids Res; 2004; 32(10):3115-23. PubMed ID: 15181177
[TBL] [Abstract][Full Text] [Related]
16. A new fast algorithm for solving the minimum spanning tree problem based on DNA molecules computation.
Wang Z; Huang D; Meng H; Tang C
Biosystems; 2013 Oct; 114(1):1-7. PubMed ID: 23871964
[TBL] [Abstract][Full Text] [Related]
17. The evolution of cellular computing: nature's solution to a computational problem.
Landweber LF; Kari L
Biosystems; 1999 Oct; 52(1-3):3-13. PubMed ID: 10636025
[TBL] [Abstract][Full Text] [Related]
18. Molecular computation by DNA hairpin formation.
Sakamoto K; Gouzu H; Komiya K; Kiga D; Yokoyama S; Yokomori T; Hagiya M
Science; 2000 May; 288(5469):1223-6. PubMed ID: 10817993
[TBL] [Abstract][Full Text] [Related]
19. DNA computing.
Gibbons A; Amos M; Hodgson D
Curr Opin Biotechnol; 1997 Feb; 8(1):103-6. PubMed ID: 9013647
[TBL] [Abstract][Full Text] [Related]
20. An Embedded Hamiltonian Graph-Guided Heuristic Algorithm for Two-Echelon Vehicle Routing Problem.
Huang H; Yang S; Li X; Hao Z
IEEE Trans Cybern; 2022 Jul; 52(7):5695-5707. PubMed ID: 34784290
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
