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.
265 related articles for article (PubMed ID: 15917122)
61. Location of repetitive regions in sequences by optimizing a compression method. Delgrange O; Dauchet M; Rivals E Pac Symp Biocomput; 1999; ():254-65. PubMed ID: 10380202 [TBL] [Abstract][Full Text] [Related]
62. 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]
63. InfoEvolve: moving from data to knowledge using information theory and genetic algorithms. Vaidyanathan G Ann N Y Acad Sci; 2004 May; 1020():227-38. PubMed ID: 15208195 [TBL] [Abstract][Full Text] [Related]
64. DNA melting profiles from a matrix method. Poland D Biopolymers; 2004 Feb; 73(2):216-28. PubMed ID: 14755579 [TBL] [Abstract][Full Text] [Related]
65. 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]
66. Modeling of 2-D DNA display. Florescu AM; Joyeux M; Lafay B Electrophoresis; 2009 Nov; 30(21):3649-56. PubMed ID: 19862742 [TBL] [Abstract][Full Text] [Related]
67. Molecular Sticker Model Stimulation on Silicon for a Maximum Clique Problem. Ning J; Li Y; Yu W Int J Mol Sci; 2015 Jun; 16(6):13474-89. PubMed ID: 26075867 [TBL] [Abstract][Full Text] [Related]
68. 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]
69. Predicting crossover generation in DNA shuffling. Moore GL; Maranas CD; Lutz S; Benkovic SJ Proc Natl Acad Sci U S A; 2001 Mar; 98(6):3226-31. PubMed ID: 11248060 [TBL] [Abstract][Full Text] [Related]
70. A new approach to population sizing for memetic algorithms: a case study for the multidimensional assignment problem. Karapetyan D; Gutin G Evol Comput; 2011; 19(3):345-71. PubMed ID: 20868263 [TBL] [Abstract][Full Text] [Related]
71. The emergence of complexity: lessons from DNA. Mao C PLoS Biol; 2004 Dec; 2(12):e431. PubMed ID: 15597116 [TBL] [Abstract][Full Text] [Related]
72. 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]
73. Fast parallel DNA-based algorithms for molecular computation: quadratic congruence and factoring integers. Chang WL IEEE Trans Nanobioscience; 2012 Mar; 11(1):62-9. PubMed ID: 21914574 [TBL] [Abstract][Full Text] [Related]
74. 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]
75. 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]
76. A hybrid metaheuristic for closest string problem. Mousavi SR Int J Comput Biol Drug Des; 2011; 4(3):245-61. PubMed ID: 21778558 [TBL] [Abstract][Full Text] [Related]