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)

  • 1. A Graph-Based Approach for the DNA Word Design Problem.
    Luncasu V; Raschip M
    IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(6):2747-2752. PubMed ID: 32750888
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Thermodynamic Post-Processing versus GC-Content Pre-Processing for DNA Codes Satisfying the Hamming Distance and Reverse-Complement Constraints.
    Tulpan D; Smith DH; Montemanni R
    IEEE/ACM Trans Comput Biol Bioinform; 2014; 11(2):441-52. PubMed ID: 26355790
    [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. On combinatorial DNA word design.
    Marathe A; Condon AE; Corn RM
    J Comput Biol; 2001; 8(3):201-19. PubMed ID: 11535173
    [TBL] [Abstract][Full Text] [Related]  

  • 5. A new fast algorithm for solving the minimum spanning tree problem based on DNA molecules computation.
    Wang Z; Huang D; Meng H; Tang C
    Biosystems; 2013 Oct; 114(1):1-7. PubMed ID: 23871964
    [TBL] [Abstract][Full Text] [Related]  

  • 6. A new parallel DNA algorithm to solve the task scheduling problem based on inspired computational model.
    Wang Z; Ji Z; Wang X; Wu T; Huang W
    Biosystems; 2017 Dec; 162():59-65. PubMed ID: 28890344
    [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. An Efficient Design for a Multi-objective Evolutionary Algorithm to Generate DNA Libraries Suitable for Computation.
    Chaves-González JM; Martínez-Gil J
    Interdiscip Sci; 2019 Sep; 11(3):542-558. PubMed ID: 30168035
    [TBL] [Abstract][Full Text] [Related]  

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

  • 10. Digital parity and the composition of the nucleotide alphabet. Shaping the alphabet with error coding.
    MacDónaill DA
    IEEE Eng Med Biol Mag; 2006; 25(1):54-61. PubMed ID: 16485392
    [No Abstract]   [Full Text] [Related]  

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

  • 12. Optimal algorithms for the interval location problem with range constraints on length and average.
    Hsieh YH; Yu CC; Wang BF
    IEEE/ACM Trans Comput Biol Bioinform; 2008; 5(2):281-90. PubMed ID: 18451437
    [TBL] [Abstract][Full Text] [Related]  

  • 13. FMG: An observable DNA storage coding method based on frequency matrix game graphs.
    Cao B; Shi P; Zheng Y; Zhang Q
    Comput Biol Med; 2022 Dec; 151(Pt A):106269. PubMed ID: 36356390
    [TBL] [Abstract][Full Text] [Related]  

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

  • 15. Insertion and deletion correcting DNA barcodes based on watermarks.
    Kracht D; Schober S
    BMC Bioinformatics; 2015 Feb; 16():50. PubMed ID: 25887410
    [TBL] [Abstract][Full Text] [Related]  

  • 16. A multilevel probabilistic beam search algorithm for the shortest common supersequence problem.
    Gallardo JE
    PLoS One; 2012; 7(12):e52427. PubMed ID: 23300667
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Comparative testing of DNA segmentation algorithms using benchmark simulations.
    Elhaik E; Graur D; Josic K
    Mol Biol Evol; 2010 May; 27(5):1015-24. PubMed ID: 20018981
    [TBL] [Abstract][Full Text] [Related]  

  • 18. tacg--a grep for DNA.
    Mangalam HJ
    BMC Bioinformatics; 2002; 3():8. PubMed ID: 11882250
    [TBL] [Abstract][Full Text] [Related]  

  • 19. A note on computational approaches for the antibandwidth problem.
    Sinnl M
    Cent Eur J Oper Res; 2021; 29(3):1057-1077. PubMed ID: 34776784
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs.
    Kundeti VK; Rajasekaran S; Dinh H; Vaughn M; Thapar V
    BMC Bioinformatics; 2010 Nov; 11():560. PubMed ID: 21078174
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.