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 *

117 related articles for article (PubMed ID: 32750888)

  • 21. iEnhancer-KL: A Novel Two-Layer Predictor for Identifying Enhancers by Position Specific of Nucleotide Composition.
    Lyu Y; Zhang Z; Li J; He W; Ding Y; Guo F
    IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(6):2809-2815. PubMed ID: 33481715
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Approximate Graph Edit Distance in Quadratic Time.
    Riesen K; Ferrer M; Bunke H
    IEEE/ACM Trans Comput Biol Bioinform; 2020; 17(2):483-494. PubMed ID: 26390496
    [TBL] [Abstract][Full Text] [Related]  

  • 23. The k partition-distance problem.
    Chen YH
    J Comput Biol; 2012 Apr; 19(4):404-17. PubMed ID: 22468708
    [TBL] [Abstract][Full Text] [Related]  

  • 24. An Intelligent Optimization Algorithm for Constructing a DNA Storage Code: NOL-HHO.
    Yin Q; Cao B; Li X; Wang B; Zhang Q; Wei X
    Int J Mol Sci; 2020 Mar; 21(6):. PubMed ID: 32235762
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Swiftly computing center strings.
    Hufsky F; Kuchenbecker L; Jahn K; Stoye J; Böcker S
    BMC Bioinformatics; 2011 Apr; 12():106. PubMed ID: 21504573
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Rational design of DNA sequences for nanotechnology, microarrays and molecular computers using Eulerian graphs.
    Pancoska P; Moravek Z; Moll UM
    Nucleic Acids Res; 2004; 32(15):4630-45. PubMed ID: 15333695
    [TBL] [Abstract][Full Text] [Related]  

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

  • 28. Combinatorial constraint coding based on the EORS algorithm in DNA storage.
    Xiaoru L; Ling G
    PLoS One; 2021; 16(7):e0255376. PubMed ID: 34324571
    [TBL] [Abstract][Full Text] [Related]  

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

  • 30. On the representation of de Bruijn graphs.
    Chikhi R; Limasset A; Jackman S; Simpson JT; Medvedev P
    J Comput Biol; 2015 May; 22(5):336-52. PubMed ID: 25629448
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Genome Rearrangements on Multigenomic Models: Applications of Graph Convexity Problems.
    Cunha LFI; Protti F
    J Comput Biol; 2019 Nov; 26(11):1214-1222. PubMed ID: 31120333
    [No Abstract]   [Full Text] [Related]  

  • 32. The double digest problem: finding all solutions.
    Sur-Kolay S; Banerjee S; Mukhopadhyaya S; Murthy CA
    Int J Bioinform Res Appl; 2009; 5(5):570-92. PubMed ID: 19778871
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Design of nucleic acid sequences for DNA computing based on a thermodynamic approach.
    Tanaka F; Kameda A; Yamamoto M; Ohuchi A
    Nucleic Acids Res; 2005; 33(3):903-11. PubMed ID: 15701762
    [TBL] [Abstract][Full Text] [Related]  

  • 34. EvoMD: an algorithm for evolutionary molecular design.
    Wong SS; Luo W; Chan KC
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(4):987-1003. PubMed ID: 20876937
    [TBL] [Abstract][Full Text] [Related]  

  • 35. A novel bio-heuristic computing algorithm to solve the capacitated vehicle routing problem based on Adleman-Lipton model.
    Wang Z; Ren X; Ji Z; Huang W; Wu T
    Biosystems; 2019 Oct; 184():103997. PubMed ID: 31369836
    [TBL] [Abstract][Full Text] [Related]  

  • 36. The maximum clique enumeration problem: algorithms, applications, and implementations.
    Eblen JD; Phillips CA; Rogers GL; Langston MA
    BMC Bioinformatics; 2012 Jun; 13 Suppl 10(Suppl 10):S5. PubMed ID: 22759429
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Quantum Speedup and Mathematical Solutions of Implementing Bio-Molecular Solutions for the Independent Set Problem on IBM Quantum Computers.
    Chang WL; Chen JC; Chung WY; Hsiao CY; Wong R; Vasilakos AV
    IEEE Trans Nanobioscience; 2021 Jul; 20(3):354-376. PubMed ID: 33900920
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 40. libFLASM: a software library for fixed-length approximate string matching.
    Ayad LA; Pissis SP; Retha A
    BMC Bioinformatics; 2016 Nov; 17(1):454. PubMed ID: 27832739
    [TBL] [Abstract][Full Text] [Related]  

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