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.
92 related articles for article (PubMed ID: 30153254)
1. 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]
2. 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]
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 outer approximation method for the road network design problem. Asadi Bagloee S; Sarvi M PLoS One; 2018; 13(3):e0192454. PubMed ID: 29590111 [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]
15. ET-Motif: Solving the Exact (l, d)-Planted Motif Problem Using Error Tree Structure. Al-Okaily A; Huang CH J Comput Biol; 2016 Jul; 23(7):615-23. PubMed ID: 27152692 [TBL] [Abstract][Full Text] [Related]
16. Hiring your next partner: AOA critical issues. Blasier RD; Gagnon MR; Iannotti JP; Jarvis-Selinger S J Bone Joint Surg Am; 2014 Sep; 96(17):e150. PubMed ID: 25187594 [TBL] [Abstract][Full Text] [Related]
17. 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]
18. A Real-Time Method for Decoding the Neural Drive to Muscles Using Single-Channel Intra-Muscular EMG Recordings. Karimimehr S; Marateb HR; Muceli S; Mansourian M; Mañanas MA; Farina D Int J Neural Syst; 2017 Sep; 27(6):1750025. PubMed ID: 28427290 [TBL] [Abstract][Full Text] [Related]
19. Estimating effective population size from temporally spaced samples with a novel, efficient maximum-likelihood algorithm. Hui TY; Burt A Genetics; 2015 May; 200(1):285-93. PubMed ID: 25747459 [TBL] [Abstract][Full Text] [Related]
20. 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] [Next] [New Search]