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 *

119 related articles for article (PubMed ID: 10021747)

  • 1. DNA computation: theory, practice, and prospects.
    Maley CC
    Evol Comput; 1998; 6(3):201-29. PubMed ID: 10021747
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Scalability of the surface-based DNA algorithm for 3-SAT.
    Li D; Li X; Huang H; Li X
    Biosystems; 2006 Aug; 85(2):95-8. PubMed ID: 16423447
    [TBL] [Abstract][Full Text] [Related]  

  • 3. The complexities of DNA computation.
    Cox JC; Cohen DS; Ellington AD
    Trends Biotechnol; 1999 Apr; 17(4):151-4. PubMed ID: 10203773
    [TBL] [Abstract][Full Text] [Related]  

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

  • 5. Molecular computation of solutions to combinatorial problems.
    Adleman LM
    Science; 1994 Nov; 266(5187):1021-4. PubMed ID: 7973651
    [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. A sticker-based model for DNA computation.
    Roweis S; Winfree E; Burgoyne R; Chelyapov NV; Goodman MF; Rothemund PW; Adleman LM
    J Comput Biol; 1998; 5(4):615-29. PubMed ID: 10072080
    [TBL] [Abstract][Full Text] [Related]  

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

  • 9. A parallel algorithm for solving the n-queens problem based on inspired computational model.
    Wang Z; Huang D; Tan J; Liu T; Zhao K; Li L
    Biosystems; 2015 May; 131():22-9. PubMed ID: 25817410
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Graph Computation Using Algorithmic Self-Assembly of DNA Molecules.
    Xu J; Chen C; Shi X
    ACS Synth Biol; 2022 Jul; 11(7):2456-2463. PubMed ID: 35703038
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 13. Combining multi-scale composite windows with hierarchical smoothing strategy for fingerprint orientation field computation.
    Li H; Wang T; Tang Y; Wu J; Yu P; Guo L; Chen J; Zhang Y
    Biomed Eng Online; 2018 Oct; 17(1):136. PubMed ID: 30285765
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 16. Hairpin formation in DNA computation presents limits for large NP-complete problems.
    Li D; Huang H; Li X; Li X
    Biosystems; 2003 Dec; 72(3):203-7. PubMed ID: 14643488
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Solving the fully-connected 15-city TSP using probabilistic DNA computing.
    Xiong F; Spetzler D; Frasch WD
    Integr Biol (Camb); 2009 Mar; 1(3):275-80. PubMed ID: 20023738
    [TBL] [Abstract][Full Text] [Related]  

  • 18. DNA-Based Analog Computing.
    Fu D; Shah S; Song T; Reif J
    Methods Mol Biol; 2018; 1772():411-417. PubMed ID: 29754242
    [TBL] [Abstract][Full Text] [Related]  

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

  • 20. Dynamically error-corrected gates for universal quantum computation.
    Khodjasteh K; Viola L
    Phys Rev Lett; 2009 Feb; 102(8):080501. PubMed ID: 19257727
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.