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 *

162 related articles for article (PubMed ID: 26512650)

  • 41. Parallel molecular computation of modular-multiplication with two same inputs over finite field GF(2(n)) using self-assembly of DNA tiles.
    Li Y; Xiao L; Ruan L
    Comput Biol Chem; 2014 Jun; 50():82-7. PubMed ID: 24534382
    [TBL] [Abstract][Full Text] [Related]  

  • 42. More reliable protein NMR peak assignment via improved 2-interval scheduling.
    Chen ZZ; Lin G; Rizzi R; Wen J; Xu D; Xu Y; Jiang T
    J Comput Biol; 2005 Mar; 12(2):129-46. PubMed ID: 15767773
    [TBL] [Abstract][Full Text] [Related]  

  • 43. An unenumerative DNA computing model for vertex coloring problem.
    Xu J; Qiang X; Yang Y; Wang B; Yang D; Luo L; Pan L; Wang S
    IEEE Trans Nanobioscience; 2011 Jun; 10(2):94-8. PubMed ID: 21742570
    [TBL] [Abstract][Full Text] [Related]  

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

  • 45. Micro flow bio-molecular computation.
    Gehani A; Reif J
    Biosystems; 1999 Oct; 52(1-3):197-216. PubMed ID: 10636046
    [TBL] [Abstract][Full Text] [Related]  

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

  • 47. Applying DNA computation to intractable problems in social network analysis.
    Chen RC; Yang SJ
    Biosystems; 2010 Sep; 101(3):222-32. PubMed ID: 20566337
    [TBL] [Abstract][Full Text] [Related]  

  • 48. Solving the 3-SAT problem based on DNA computing.
    Liu W; Gao L; Liu X; Wang S; Xu J
    J Chem Inf Comput Sci; 2003; 43(6):1872-5. PubMed ID: 14632435
    [TBL] [Abstract][Full Text] [Related]  

  • 49. In Vitro Identification of the Hamiltonian Cycle Using a Circular Structure Assisted DNA Computer.
    Sharma D; Ramteke M
    ACS Comb Sci; 2020 May; 22(5):225-231. PubMed ID: 32212630
    [TBL] [Abstract][Full Text] [Related]  

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

  • 51. A Chinese Postman Problem based on DNA computing.
    Yin Z; Zhang F; Xu J
    J Chem Inf Comput Sci; 2002; 42(2):222-4. PubMed ID: 11911690
    [TBL] [Abstract][Full Text] [Related]  

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

  • 53. Fast computation of exact solutions of generic and degenerate assignment problems.
    Koehl P; Orland H
    Phys Rev E; 2021 Apr; 103(4-1):042101. PubMed ID: 34005932
    [TBL] [Abstract][Full Text] [Related]  

  • 54. Solving a four-destination traveling salesman problem using Escherichia coli cells as biocomputers.
    Esau M; Rozema M; Zhang TH; Zeng D; Chiu S; Kwan R; Moorhouse C; Murray C; Tseng NT; Ridgway D; Sauvageau D; Ellison M
    ACS Synth Biol; 2014 Dec; 3(12):972-5. PubMed ID: 25524102
    [TBL] [Abstract][Full Text] [Related]  

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

  • 56. Using three-dimensional microfluidic networks for solving computationally hard problems.
    Chiu DT; Pezzoli E; Wu H; Stroock AD; Whitesides GM
    Proc Natl Acad Sci U S A; 2001 Mar; 98(6):2961-6. PubMed ID: 11248014
    [TBL] [Abstract][Full Text] [Related]  

  • 57. Extending molecular simulation time scales: Parallel in time integrations for high-level quantum chemistry and complex force representations.
    Bylaska EJ; Weare JQ; Weare JH
    J Chem Phys; 2013 Aug; 139(7):074114. PubMed ID: 23968079
    [TBL] [Abstract][Full Text] [Related]  

  • 58. An Airway Network Flow Assignment Approach Based on an Efficient Multiobjective Optimization Framework.
    Guan X; Zhang X; Zhu Y; Sun D; Lei J
    ScientificWorldJournal; 2015; 2015():302615. PubMed ID: 26180840
    [TBL] [Abstract][Full Text] [Related]  

  • 59. Computing exponentially faster: implementing a non-deterministic universal Turing machine using DNA.
    Currin A; Korovin K; Ababi M; Roper K; Kell DB; Day PJ; King RD
    J R Soc Interface; 2017 Mar; 14(128):. PubMed ID: 28250099
    [TBL] [Abstract][Full Text] [Related]  

  • 60. Optical solver of combinatorial problems: nanotechnological approach.
    Cohen E; Dolev S; Frenkel S; Kryzhanovsky B; Palagushkin A; Rosenblit M; Zakharov V
    J Opt Soc Am A Opt Image Sci Vis; 2013 Sep; 30(9):1845-53. PubMed ID: 24323266
    [TBL] [Abstract][Full Text] [Related]  

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