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.
2. Refining the In-Parameter-Order Strategy for Constructing Covering Arrays. Forbes M; Lawrence J; Lei Y; Kacker RN; Kuhn DR J Res Natl Inst Stand Technol; 2008; 113(5):287-97. PubMed ID: 27096128 [TBL] [Abstract][Full Text] [Related]
3. Accelerating covering array generation by combinatorial join for industry scale software testing. Ukai H; Qu X; Washizaki H; Fukazawa Y PeerJ Comput Sci; 2022; 8():e720. PubMed ID: 35494846 [TBL] [Abstract][Full Text] [Related]
4. Joker de Bruijn: Covering k-Mers Using Joker Characters. Orenstein Y; Yu YW; Berger B J Comput Biol; 2018 Nov; 25(11):1171-1178. PubMed ID: 30117747 [TBL] [Abstract][Full Text] [Related]
5. Intelligent Supply Chain and Logistics Route Optimization Algorithm in Wireless Sensor Network. Ma Z; Yang X; Li H Comput Intell Neurosci; 2022; 2022():8161820. PubMed ID: 35669634 [TBL] [Abstract][Full Text] [Related]
6. The distribution and deposition algorithm for multiple oligo nucleotide arrays. Ning K; Leong HW Genome Inform; 2006; 17(2):89-99. PubMed ID: 17503382 [TBL] [Abstract][Full Text] [Related]
8. Positions and covering: A two-stage methodology to obtain optimal solutions for the 2d-bin packing problem. Cid-Garcia NM; Rios-Solis YA PLoS One; 2020; 15(4):e0229358. PubMed ID: 32251428 [TBL] [Abstract][Full Text] [Related]
9. The k partition-distance problem. Chen YH J Comput Biol; 2012 Apr; 19(4):404-17. PubMed ID: 22468708 [TBL] [Abstract][Full Text] [Related]
10. Parameterized runtime analyses of evolutionary algorithms for the planar euclidean traveling salesperson problem. Sutton AM; Neumann F; Nallaperuma S Evol Comput; 2014; 22(4):595-628. PubMed ID: 24479542 [TBL] [Abstract][Full Text] [Related]
11. Performance Analysis of Evolutionary Algorithms for Steiner Tree Problems. Lai X; Zhou Y; Xia X; Zhang Q Evol Comput; 2017; 25(4):707-723. PubMed ID: 27959580 [TBL] [Abstract][Full Text] [Related]
12. A Case Study of Controlling Crossover in a Selection Hyper-heuristic Framework Using the Multidimensional Knapsack Problem. Drake JH; Özcan E; Burke EK Evol Comput; 2016; 24(1):113-41. PubMed ID: 25635698 [TBL] [Abstract][Full Text] [Related]
13. Chemical reaction optimization for solving shortest common supersequence problem. Khaled Saifullah CM; Rafiqul Islam M Comput Biol Chem; 2016 Oct; 64():82-93. PubMed ID: 27299980 [TBL] [Abstract][Full Text] [Related]
14. A dynamic multiarmed bandit-gene expression programming hyper-heuristic for combinatorial optimization problems. Sabar NR; Ayob M; Kendall G; Qu R IEEE Trans Cybern; 2015 Feb; 45(2):217-28. PubMed ID: 24951713 [TBL] [Abstract][Full Text] [Related]
15. Error Tree: A Tree Structure for Hamming and Edit Distances and Wildcards Matching. Al-Okaily A J Comput Biol; 2015 Dec; 22(12):1118-28. PubMed ID: 26402070 [TBL] [Abstract][Full Text] [Related]
16. Cost-minimizing team hires with participation constraint. Sun H; Huang J; Liu K; Wan M; Zhou Y; Cao C; Jia X; He L PLoS One; 2018; 13(8):e0201596. PubMed ID: 30153254 [TBL] [Abstract][Full Text] [Related]
17. Treatment delivery software for a new clinical grade ultrasound system for thermoradiotherapy. Novák P; Moros EG; Straube WL; Myerson RJ Med Phys; 2005 Nov; 32(11):3246-56. PubMed ID: 16372408 [TBL] [Abstract][Full Text] [Related]
19. A Simple Approach to the Reconstruction of a Set of Points from the Multiset of n Fomin E J Comput Biol; 2016 Dec; 23(12):934-942. PubMed ID: 27310815 [TBL] [Abstract][Full Text] [Related]