{"id":"W1995860689","doi":"10.1021/sb5000466","title":"Solving a Four-Destination Traveling Salesman Problem Using <i>Escherichia coli</i> Cells As Biocomputers","year":2014,"lang":"en","type":"article","venue":"ACS Synthetic Biology","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Genome Alberta; University of Alberta; Alberta Innovates - Technology Futures","keywords":"Travelling salesman problem; Computer science; Population; Selection (genetic algorithm); Shortest path problem; Path (computing); Mathematical optimization; Mathematics; Algorithm; Theoretical computer science; Artificial intelligence; Graph; Computer network","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002310081,0.000420878,0.0003385827,0.0002238821,0.0002952218,0.0005431041,0.0005298246,0.0004354215,0.001053045],"category_scores_gemma":[0.0006594587,0.0001844436,0.0003312748,0.0003624052,0.0002840341,0.00031559,0.0002474286,0.000496576,0.000189693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003783546,"about_ca_system_score_gemma":0.0006630686,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002763167,"about_ca_topic_score_gemma":0.002592212,"domain_scores_codex":[0.9998796,0.00003875195,0.00001157784,0.00002840328,0.00002082218,0.00002082385],"domain_scores_gemma":[0.9997684,0.0001243046,0.00003671305,0.00002001543,0.00003014911,0.00002041394],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0004334229,0.0004099787,0.004667073,0.0002949206,0.00008830935,0.0005011097,0.0001954295,0.7269813,0.1670152,0.02206521,0.001064162,0.07628382],"study_design_scores_gemma":[0.00004909498,0.0002604325,0.0006218608,0.000006894954,0.00002658567,0.00008836819,0.0001060501,0.9124011,0.07750219,0.005817155,0.003104276,0.00001594434],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5855187,0.0001120877,0.4094162,0.0002257859,0.00002390775,0.00008328685,0.0001263674,0.0003361689,0.004157415],"genre_scores_gemma":[0.5662656,0.0001401426,0.4314934,0.00003639363,0.0000049751,0.00009765417,0.0002614413,0.0000506455,0.001649647],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002763167,"threshold_uncertainty_score":0.005494118,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01857060975891769,"score_gpt":0.2462953238678618,"score_spread":0.2277247141089442,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}