BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

114 related articles for article (PubMed ID: 15013224)

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

  • 2. Fast parallel molecular solutions for DNA-based supercomputing: the subset-product problem.
    Ho MS
    Biosystems; 2005 Jun; 80(3):233-50. PubMed ID: 15981311
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

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

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

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

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

  • 11. A novel generalized design methodology and realization of Boolean operations using DNA.
    Zoraida BS; Arock M; Ronald BS; Ponalagusamy R
    Biosystems; 2009 Sep; 97(3):146-53. PubMed ID: 19505531
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 17. [Study of numerical mapping methods for DNA sequences].
    Nini R; Lijun Q
    Sheng Wu Yi Xue Gong Cheng Xue Za Zhi; 2005 Aug; 22(4):681-5. PubMed ID: 16156249
    [TBL] [Abstract][Full Text] [Related]  

  • 18. An algorithm for the study of DNA sequence evolution based on the genetic code.
    Sirakoulis GCh; Karafyllidis I; Sandaltzopoulos R; Tsalides P; Thanailakis A
    Biosystems; 2004 Nov; 77(1-3):11-23. PubMed ID: 15527941
    [TBL] [Abstract][Full Text] [Related]  

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

  • 20. Alignment-based approach for durable data storage into living organisms.
    Yachie N; Sekiyama K; Sugahara J; Ohashi Y; Tomita M
    Biotechnol Prog; 2007; 23(2):501-5. PubMed ID: 17253725
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.