BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

162 related articles for article (PubMed ID: 26512650)

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

  • 22. A DNA algorithm for the job shop scheduling problem based on the Adleman-Lipton model.
    Tian X; Liu X; Zhang H; Sun M; Zhao Y
    PLoS One; 2020; 15(12):e0242083. PubMed ID: 33264317
    [TBL] [Abstract][Full Text] [Related]  

  • 23. DNA strand generation for DNA computing by using a multi-objective differential evolution algorithm.
    Chaves-González JM; Vega-Rodríguez MA
    Biosystems; 2014 Feb; 116():49-64. PubMed ID: 24361487
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 26. Solving multiconstraint assignment problems using learning automata.
    Horn G; Oommen BJ
    IEEE Trans Syst Man Cybern B Cybern; 2010 Feb; 40(1):6-18. PubMed ID: 19884057
    [TBL] [Abstract][Full Text] [Related]  

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

  • 28. Virtual parallel computing and a search algorithm using matrix product states.
    Chamon C; Mucciolo ER
    Phys Rev Lett; 2012 Jul; 109(3):030503. PubMed ID: 22861832
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

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

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

  • 35. Hybridization-ligation versus parallel overlap assembly: an experimental comparison of initial pool generation for direct-proportional length-based DNA computing.
    Ibrahim Z; Tsuboi Y; Ono O
    IEEE Trans Nanobioscience; 2006 Jun; 5(2):103-9. PubMed ID: 16805106
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Design of a DNA-based reversible arithmetic and logic unit.
    Sarker A; Hasan Babu HM; Rashid SM
    IET Nanobiotechnol; 2015 Aug; 9(4):226-38. PubMed ID: 26224353
    [TBL] [Abstract][Full Text] [Related]  

  • 37. DNA strand displacement system running logic programs.
    Rodríguez-Patón A; Sainz de Murieta I; Sosík P
    Biosystems; 2014 Jan; 115():5-12. PubMed ID: 24211259
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Solving the multiple competitive facilities location and design problem on the plane.
    Redondo JL; Fernández J; García I; Ortigosa PM
    Evol Comput; 2009; 17(1):21-53. PubMed ID: 19207087
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Parallel computation with molecular-motor-propelled agents in nanofabricated networks.
    Nicolau DV; Lard M; Korten T; van Delft FC; Persson M; Bengtsson E; Månsson A; Diez S; Linke H; Nicolau DV
    Proc Natl Acad Sci U S A; 2016 Mar; 113(10):2591-6. PubMed ID: 26903637
    [TBL] [Abstract][Full Text] [Related]  

  • 40. The art of molecular computing: Whence and whither.
    Gangadharan S; Raman K
    Bioessays; 2021 Aug; 43(8):e2100051. PubMed ID: 34101866
    [TBL] [Abstract][Full Text] [Related]  

    [Previous]   [Next]    [New Search]
    of 9.