136 related articles for article (PubMed ID: 14643494)
21. 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]
22. A DNA solution of SAT problem by a modified sticker model.
Yang CN; Yang CB
Biosystems; 2005 Jul; 81(1):1-9. PubMed ID: 15917122
[TBL] [Abstract][Full Text] [Related]
23. 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]
24. 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]
25. Exploring the Potential of DNA Computing for Complex Big Data Problems: A Case Study on the Traveling Car Renter Problem.
Wang ZC; Wu X; Liang K; Wu TH
IEEE Trans Nanobioscience; 2024 Jul; 23(3):391-402. PubMed ID: 38709614
[TBL] [Abstract][Full Text] [Related]
26. A comparative runtime analysis of heuristic algorithms for satisfiability problems.
Zhou Y; He J; Nie Q
Artif Intell; 2009 Feb; 173(2):240-257. PubMed ID: 20126510
[TBL] [Abstract][Full Text] [Related]
27. A Novel Algorithm for Solving the Prize Collecting Traveling Salesman Problem Based on DNA Computing.
Wang ZC; Liang K; Bao XG; Wu TH
IEEE Trans Nanobioscience; 2024 Apr; 23(2):220-232. PubMed ID: 37607150
[TBL] [Abstract][Full Text] [Related]
28. Towards a Bioelectronic Computer: A Theoretical Study of a Multi-Layer Biomolecular Computing System That Can Process Electronic Inputs.
Dunn KE; Trefzer MA; Johnson S; Tyrrell AM
Int J Mol Sci; 2018 Sep; 19(9):. PubMed ID: 30181468
[TBL] [Abstract][Full Text] [Related]
29. DNA computation: theory, practice, and prospects.
Maley CC
Evol Comput; 1998; 6(3):201-29. PubMed ID: 10021747
[TBL] [Abstract][Full Text] [Related]
30. Parallel DNA Arithmetic Operation With One Error Detection Based on 3-Moduli Set.
Zheng X; Wang B; Zhou C; Wei X; Zhang Q
IEEE Trans Nanobioscience; 2016 Jul; 15(5):499-507. PubMed ID: 27323370
[TBL] [Abstract][Full Text] [Related]
31. 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]
32. GASAT: a genetic local search algorithm for the satisfiability problem.
Lardeux F; Saubion F; Hao JK
Evol Comput; 2006; 14(2):223-53. PubMed ID: 16831107
[TBL] [Abstract][Full Text] [Related]
33. A new solution for maximal clique problem based sticker model.
Darehmiraki M
Biosystems; 2009 Feb; 95(2):145-9. PubMed ID: 18992786
[TBL] [Abstract][Full Text] [Related]
34. DNA-algorithm for timetable problem.
Popov IY; Vorobyova AV; Blinova IV
Int J Bioinform Res Appl; 2014; 10(2):145-56. PubMed ID: 24589834
[TBL] [Abstract][Full Text] [Related]
35. 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]
36. 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]
37. Quantum algorithms for biomolecular solutions of the satisfiability problem on a quantum machine.
Chang WL; Ren TT; Luo J; Feng M; Guo M; Weicheng Lin K
IEEE Trans Nanobioscience; 2008 Sep; 7(3):215-22. PubMed ID: 18779102
[TBL] [Abstract][Full Text] [Related]
38. Solving hard computational problems efficiently: asymptotic parametric complexity 3-coloring algorithm.
Martín H JA
PLoS One; 2013; 8(1):e53437. PubMed ID: 23349711
[TBL] [Abstract][Full Text] [Related]
39. Haplotype inference by Pure Parsimony: a survey.
Graça A; Lynce I; Marques-Silva J; Oliveira AL
J Comput Biol; 2010 Aug; 17(8):969-92. PubMed ID: 20726791
[TBL] [Abstract][Full Text] [Related]
40. Solving the SAT problem using a DNA computing algorithm based on ligase chain reaction.
Wang X; Bao Z; Hu J; Wang S; Zhan A
Biosystems; 2008 Jan; 91(1):117-25. PubMed ID: 17904730
[TBL] [Abstract][Full Text] [Related]
[Previous] [Next] [New Search]
