These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

190 related articles for article (PubMed ID: 7725098)

  • 1. DNA solution of hard computational problems.
    Lipton RJ
    Science; 1995 Apr; 268(5210):542-5. PubMed ID: 7725098
    [TBL] [Abstract][Full Text] [Related]  

  • 2. A boom in plans for DNA computing.
    Pool R
    Science; 1995 Apr; 268(5210):498-9. PubMed ID: 7725093
    [No Abstract]   [Full Text] [Related]  

  • 3. 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]  

  • 4. Solving the 0/1 knapsack problem by a biomolecular DNA computer.
    Taghipour H; Rezaei M; Esmaili HA
    Adv Bioinformatics; 2013; 2013():341419. PubMed ID: 23509451
    [TBL] [Abstract][Full Text] [Related]  

  • 5. DNA computing using single-molecule hybridization detection.
    Schmidt KA; Henkel CV; Rozenberg G; Spaink HP
    Nucleic Acids Res; 2004; 32(17):4962-8. PubMed ID: 15388798
    [TBL] [Abstract][Full Text] [Related]  

  • 6. 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]  

  • 7. 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]  

  • 8. Amoeba-inspired nanoarchitectonic computing: solving intractable computational problems using nanoscale photoexcitation transfer dynamics.
    Aono M; Naruse M; Kim SJ; Wakabayashi M; Hori H; Ohtsu M; Hara M
    Langmuir; 2013 Jun; 29(24):7557-64. PubMed ID: 23565603
    [TBL] [Abstract][Full Text] [Related]  

  • 9. On the potential of molecular computing.
    Bunow B
    Science; 1995 Apr; 268(5210):482-3. PubMed ID: 7725087
    [No Abstract]   [Full Text] [Related]  

  • 10. 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]  

  • 11. Non-discrete biomolecular computing: an approach to computational complexity.
    Rambidi NG
    Biosystems; 1993; 31(1):3-13. PubMed ID: 8286703
    [TBL] [Abstract][Full Text] [Related]  

  • 12. High-throughput computing in the sciences.
    Morgan M; Grimshaw A
    Methods Enzymol; 2009; 467():197-227. PubMed ID: 19897094
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Exploring the Feasibility of a DNA Computer: Design of an ALU Using Sticker-Based DNA Model.
    Sarkar M; Ghosal P; Mohanty SP
    IEEE Trans Nanobioscience; 2017 Sep; 16(6):383-399. PubMed ID: 28715334
    [TBL] [Abstract][Full Text] [Related]  

  • 14. On the path to computation with DNA.
    Gifford DK
    Science; 1994 Nov; 266(5187):993-4. PubMed ID: 7973681
    [No Abstract]   [Full Text] [Related]  

  • 15. A CLIQUE algorithm using DNA computing techniques based on closed-circle DNA sequences.
    Zhang H; Liu X
    Biosystems; 2011 Jul; 105(1):73-82. PubMed ID: 21511001
    [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. 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]  

  • 18. 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]  

  • 19. 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]  

  • 20. A new parallel DNA algorithm to solve the task scheduling problem based on inspired computational model.
    Wang Z; Ji Z; Wang X; Wu T; Huang W
    Biosystems; 2017 Dec; 162():59-65. PubMed ID: 28890344
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 10.