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 *

274 related articles for article (PubMed ID: 15388798)

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

  • 22. DNA-probes for the highly sensitive identification of single nucleotide polymorphism using single-molecule spectroscopy.
    Friedrich A; Hoheisel JD; Marmé N; Knemeyer JP
    FEBS Lett; 2007 Apr; 581(8):1644-8. PubMed ID: 17399707
    [TBL] [Abstract][Full Text] [Related]  

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

  • 24. DNA structural changes as the basis for a nanomolecular device.
    Alberti P; Mergny JL
    Cell Mol Biol (Noisy-le-grand); 2004 May; 50(3):241-53. PubMed ID: 15209345
    [TBL] [Abstract][Full Text] [Related]  

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

  • 26. A new DNA computing model for the NAND gate based on induced hairpin formation.
    Liu W; Shi X; Zhang S; Liu X; Xu J
    Biosystems; 2004 Nov; 77(1-3):87-92. PubMed ID: 15527948
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Biomolecular computing: is it ready to take off?
    Fu P
    Biotechnol J; 2007 Jan; 2(1):91-101. PubMed ID: 17183505
    [TBL] [Abstract][Full Text] [Related]  

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

  • 29. DNA approach to solve clustering problem based on a mutual order.
    Bakar RB; Watada J; Pedrycz W
    Biosystems; 2008 Jan; 91(1):1-12. PubMed ID: 17669585
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution.
    Song YS; Wu Y; Gusfield D
    Bioinformatics; 2005 Jun; 21 Suppl 1():i413-22. PubMed ID: 15961486
    [TBL] [Abstract][Full Text] [Related]  

  • 31. A new ultrasensitive way to circumvent PCR-based allele distinction: direct probing of unamplified genomic DNA by solution-phase hybridization using two-color fluorescence cross-correlation spectroscopy.
    Földes-Papp Z; Kinjo M; Tamura M; Birch-Hirschfeld E; Demel U; Tilz GP
    Exp Mol Pathol; 2005 Jun; 78(3):177-89. PubMed ID: 15924869
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Fluorescence correlation spectroscopy for ultrasensitive DNA analysis in continuous flow capillary electrophoresis.
    Fogarty K; Van Orden A
    Methods; 2009 Mar; 47(3):151-8. PubMed ID: 18852049
    [TBL] [Abstract][Full Text] [Related]  

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

  • 34. DNA computing, computation complexity and problem of biological evolution rate.
    Melkikh AV
    Acta Biotheor; 2008 Dec; 56(4):285-95. PubMed ID: 18787960
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 38. Molecular computation by DNA hairpin formation.
    Sakamoto K; Gouzu H; Komiya K; Kiga D; Yokoyama S; Yokomori T; Hagiya M
    Science; 2000 May; 288(5469):1223-6. PubMed ID: 10817993
    [TBL] [Abstract][Full Text] [Related]  

  • 39. A new solution for maximal clique problem based sticker model.
    Darehmiraki M
    Biosystems; 2009 Feb; 95(2):145-9. PubMed ID: 18992786
    [TBL] [Abstract][Full Text] [Related]  

  • 40. [Progress in molecular biology study of DNA computer].
    Zhang ZZ; Zhao J; He L
    Yi Chuan Xue Bao; 2003 Sep; 30(9):886-92. PubMed ID: 14577383
    [TBL] [Abstract][Full Text] [Related]  

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