187 related articles for article (PubMed ID: 15555757)
1. Solving traveling salesman problems with DNA molecules encoding numerical values.
Lee JY; Shin SY; Park TH; Zhang BT
Biosystems; 2004 Dec; 78(1-3):39-47. PubMed ID: 15555757
[TBL] [Abstract][Full Text] [Related]
2. A fractional programming approach to efficient DNA melting temperature calculation.
Leber M; Kaderali L; Schönhuth A; Schrader R
Bioinformatics; 2005 May; 21(10):2375-82. PubMed ID: 15769839
[TBL] [Abstract][Full Text] [Related]
3. 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]
4. Speed-up of DNA melting algorithm with complete nearest neighbor properties.
Tøstesen E; Liu F; Jenssen TK; Hovig E
Biopolymers; 2003 Oct; 70(3):364-76. PubMed ID: 14579309
[TBL] [Abstract][Full Text] [Related]
5. 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]
6. A thermodynamic approach to designing structure-free combinatorial DNA word sets.
Shortreed MR; Chang SB; Hong D; Phillips M; Campion B; Tulpan DC; Andronescu M; Condon A; Hoos HH; Smith LM
Nucleic Acids Res; 2005; 33(15):4965-77. PubMed ID: 16284197
[TBL] [Abstract][Full Text] [Related]
7. DNA computation model to solve 0-1 programming problem.
Zhang F; Yin Z; Liu B; Xu J
Biosystems; 2004; 74(1-3):9-14. PubMed ID: 15125989
[TBL] [Abstract][Full Text] [Related]
8. 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. PubMed ID: 15740836
[TBL] [Abstract][Full Text] [Related]
9. The surface-based approach for DNA computation is unreliable for SAT.
Li D; Li X; Huang H; Li X
Biosystems; 2005 Oct; 82(1):20-5. PubMed ID: 16024166
[TBL] [Abstract][Full Text] [Related]
10. Exact solution of large asymmetric traveling salesman problems.
Miller DL; Pekny JF
Science; 1991 Feb; 251(4995):754-61. PubMed ID: 17775454
[TBL] [Abstract][Full Text] [Related]
11. Thermodynamics of unstable DNA structures from the kinetics of the microgene PCR.
Itsko M; Zaritsky A; Rabinovitch A
J Phys Chem B; 2008 Oct; 112(41):13149-56. PubMed ID: 18795769
[TBL] [Abstract][Full Text] [Related]
12. Predatory search algorithm with restriction of solution distance.
Liu C; Wang D
Biol Cybern; 2005 May; 92(5):293-302. PubMed ID: 15838682
[TBL] [Abstract][Full Text] [Related]
13. Temperature-gradient electrophoresis. A thermodynamic probe provides information on the structure of DNA and proteins.
Stevenson R
Am Biotechnol Lab; 1991 Aug; 9(7):18. PubMed ID: 1367334
[No Abstract] [Full Text] [Related]
14. Solution of a 20-variable 3-SAT problem on a DNA computer.
Braich RS; Chelyapov N; Johnson C; Rothemund PW; Adleman L
Science; 2002 Apr; 296(5567):499-502. PubMed ID: 11896237
[TBL] [Abstract][Full Text] [Related]
15. Automatic Combination of Operators in a Genetic Algorithm to Solve the Traveling Salesman Problem.
Contreras-Bolton C; Parada V
PLoS One; 2015; 10(9):e0137724. PubMed ID: 26367182
[TBL] [Abstract][Full Text] [Related]
16. Solving satisfiability problems using a novel microarray-based DNA computer.
Lin CH; Cheng HP; Yang CB; Yang CN
Biosystems; 2007; 90(1):242-52. PubMed ID: 17029765
[TBL] [Abstract][Full Text] [Related]
17. Evolving evolutionary algorithms using linear genetic programming.
Oltean M
Evol Comput; 2005; 13(3):387-410. PubMed ID: 16156929
[TBL] [Abstract][Full Text] [Related]
18. Molecular solutions to the binary integer programming problem based on DNA computation.
Yeh CW; Chu CP; Wu KR
Biosystems; 2006 Jan; 83(1):56-66. PubMed ID: 16229936
[TBL] [Abstract][Full Text] [Related]
19. Preliminary dielectric measurement and analysis protocol for determining the melting temperature and binding energy of short sequences of DNA in solution.
Spillman WB; Asmatulu R; Jullian CF; Geist B; Claus RO; Robertson JL
Biotechnol J; 2008 Feb; 3(2):252-63. PubMed ID: 18034436
[TBL] [Abstract][Full Text] [Related]
20. 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]
[Next] [New Search]
