BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

274 related articles for article (PubMed ID: 15388798)

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

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

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

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

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

  • 6. A DNA computing readout operation based on structure-specific cleavage.
    Wang L; Hall JG; Lu M; Liu Q; Smith LM
    Nat Biotechnol; 2001 Nov; 19(11):1053-9. PubMed ID: 11689851
    [TBL] [Abstract][Full Text] [Related]  

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

  • 8. DNA computing of solutions to knapsack problems.
    Henkel CV; Bäck T; Kok JN; Rozenberg G; Spaink HP
    Biosystems; 2007 Mar; 88(1-2):156-62. PubMed ID: 16860927
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

  • 14. DNA polymerase programmed with a hairpin DNA incorporates a multiple-instruction architecture into molecular computing.
    Komiya K; Sakamoto K; Kameda A; Yamamoto M; Ohuchi A; Kiga D; Yokoyama S; Hagiya M
    Biosystems; 2006 Jan; 83(1):18-25. PubMed ID: 16343736
    [TBL] [Abstract][Full Text] [Related]  

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

  • 16. Towards computing with proteins.
    Unger R; Moult J
    Proteins; 2006 Apr; 63(1):53-64. PubMed ID: 16435369
    [TBL] [Abstract][Full Text] [Related]  

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

  • 18. An integrated microfluidic processor for single nucleotide polymorphism-based DNA computing.
    Grover WH; Mathies RA
    Lab Chip; 2005 Oct; 5(10):1033-40. PubMed ID: 16175257
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Single-molecule studies on DNA and RNA.
    Greulich KO
    Chemphyschem; 2005 Dec; 6(12):2458-71. PubMed ID: 16331734
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Markov chains: computing limit existence and approximations with DNA.
    Cardona M; Colomer MA; Conde J; Miret JM; Miró J; Zaragoza A
    Biosystems; 2005 Sep; 81(3):261-6. PubMed ID: 15982800
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 14.