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 *

125 related articles for article (PubMed ID: 24589834)

  • 1. DNA-algorithm for timetable problem.
    Popov IY; Vorobyova AV; Blinova IV
    Int J Bioinform Res Appl; 2014; 10(2):145-56. PubMed ID: 24589834
    [TBL] [Abstract][Full Text] [Related]  

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

  • 3. Is optimal solution of every NP-complete or NP-hard problem determined from its characteristic for DNA-based computing.
    Guo M; Chang WL; Ho M; Lu J; Cao J
    Biosystems; 2005 Apr; 80(1):71-82. PubMed ID: 15740836
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

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

  • 9. Solving flexible job shop scheduling problems with transportation time based on improved genetic algorithm.
    Zhang GH; Sun JH; Liu X; Wang GD; Yang YY
    Math Biosci Eng; 2019 Feb; 16(3):1334-1347. PubMed ID: 30947423
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Exploring the Potential of DNA Computing for Complex Big Data Problems: A Case Study on the Traveling Car Renter Problem.
    Wang ZC; Wu X; Liang K; Wu TH
    IEEE Trans Nanobioscience; 2024 Jul; 23(3):391-402. PubMed ID: 38709614
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Workflows in bioinformatics: meta-analysis and prototype implementation of a workflow generator.
    Garcia Castro A; Thoraval S; Garcia LJ; Ragan MA
    BMC Bioinformatics; 2005 Apr; 6():87. PubMed ID: 15813976
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Scheduling the resident 80-hour work week: an operations research algorithm.
    Day TE; Napoli JT; Kuo PC
    Curr Surg; 2006; 63(2):136-41; discussion 141-2. PubMed ID: 16520117
    [TBL] [Abstract][Full Text] [Related]  

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

  • 14. Solving the Family Traveling Salesperson Problem in the Adleman-Lipton Model Based on DNA Computing.
    Wu X; Wang Z; Wu T; Bao X
    IEEE Trans Nanobioscience; 2022 Jan; 21(1):75-85. PubMed ID: 34460379
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Reconstruction of ancestral genomic sequences using likelihood.
    Elias I; Tuller T
    J Comput Biol; 2007 Mar; 14(2):216-37. PubMed ID: 17456016
    [TBL] [Abstract][Full Text] [Related]  

  • 16. A Hybrid Genetic Programming Algorithm for Automated Design of Dispatching Rules.
    Nguyen S; Mei Y; Xue B; Zhang M
    Evol Comput; 2019; 27(3):467-496. PubMed ID: 29863420
    [TBL] [Abstract][Full Text] [Related]  

  • 17. A polynomial-time algorithm computing lower and upper bounds of the rooted subtree prune and regraft distance.
    Kannan L; Li H; Mushegian A
    J Comput Biol; 2011 May; 18(5):743-57. PubMed ID: 21166560
    [TBL] [Abstract][Full Text] [Related]  

  • 18. A parallel algorithm for solving the n-queens problem based on inspired computational model.
    Wang Z; Huang D; Tan J; Liu T; Zhao K; Li L
    Biosystems; 2015 May; 131():22-9. PubMed ID: 25817410
    [TBL] [Abstract][Full Text] [Related]  

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

  • 20. Computing a smallest multilabeled phylogenetic tree from rooted triplets.
    Guillemot S; Jansson J; Sung WK
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(4):1141-7. PubMed ID: 20733243
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.