BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

141 related articles for article (PubMed ID: 21914574)

  • 1. Fast parallel DNA-based algorithms for molecular computation: quadratic congruence and factoring integers.
    Chang WL
    IEEE Trans Nanobioscience; 2012 Mar; 11(1):62-9. PubMed ID: 21914574
    [TBL] [Abstract][Full Text] [Related]  

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

  • 3. Fast parallel molecular algorithms for DNA-based computation: factoring integers.
    Chang WL; Guo M; Ho MS
    IEEE Trans Nanobioscience; 2005 Jun; 4(2):149-63. PubMed ID: 16117023
    [TBL] [Abstract][Full Text] [Related]  

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

  • 5. Molecular solutions for the subset-sum problem on DNA-based supercomputing.
    Chang WL; Ho MS; Guo M
    Biosystems; 2004 Feb; 73(2):117-30. PubMed ID: 15013224
    [TBL] [Abstract][Full Text] [Related]  

  • 6. DNA algorithm for an unbounded fan-in Boolean circuit.
    Ahrabian H; Ganjtabesh M; Nowzari-Dalini A
    Biosystems; 2005 Oct; 82(1):52-60. PubMed ID: 15982801
    [TBL] [Abstract][Full Text] [Related]  

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

  • 8. Fast parallel molecular algorithms for DNA-based computation: solving the elliptic curve discrete logarithm problem over GF2.
    Li K; Zou S; Xv J
    J Biomed Biotechnol; 2008; 2008():518093. PubMed ID: 18431451
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 12. Fast parallel DNA-based algorithms for molecular computation: the set-partition problem.
    Chang WL
    IEEE Trans Nanobioscience; 2007 Dec; 6(4):346-53. PubMed ID: 18217628
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 16. System identification: DNA computing approach.
    Huang CH; Jan HY; Lin CL; Lee CS
    ISA Trans; 2009 Jul; 48(3):254-63. PubMed ID: 19249778
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 19. A design of a parallel architecture for solving exact matching problem on DNA molecules.
    Khaled H; Faheem HM; Hasan T; Ghoneimy S
    Biomed Sci Instrum; 2007; 43():170-5. PubMed ID: 17487076
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Procedures for a dynamical system on {0,1}n with DNA molecules.
    Xiao D; Li W; Yu J; Zhang X; Zhang Z; He L
    Biosystems; 2006 Jun; 84(3):207-16. PubMed ID: 16388887
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 8.