{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":430,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":430,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"466a6697232e","filters":{"topic":"DNA and Biological Computing"}},"results":[{"id":"W1600165002","doi":"10.1007/bf03037362","title":"The power of communication: P systems with symport/antiport","year":2002,"lang":"en","type":"article","venue":"New Generation Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":341,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Membrane computing; Antiporter; Membrane; Symporter; Computer science; Computation; Power (physics); Theoretical computer science; Chemistry; Algorithm; Physics; Biochemistry; Transporter; Thermodynamics","authors":[{"name":"Andrei Păun","is_ca":true},{"name":"Gheorghe Pǎun","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02731062806746406,"gpt":0.2381451841888484,"spread":0.2108345561213844,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007895071,0.000493744,0.0006991915,0.0007509242,0.001883605,0.003700503,0.001016577,0.001973311,0.006760251],"category_scores_gemma":[0.003910293,0.0003679482,0.0003809653,0.000710323,0.004198239,0.00788939,0.001780403,0.001715013,0.0009212681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005778573,"about_ca_system_score_gemma":0.0004716475,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004004641,"about_ca_topic_score_gemma":0.0002980468,"domain_scores_codex":[0.9995589,0.000149445,0.00001845712,0.00007375887,0.0001235186,0.00007585192],"domain_scores_gemma":[0.9985549,0.0007392018,0.00008896732,0.0003080379,0.0001499729,0.0001589331],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000542183,0.00001705049,0.00008684575,0.00003661279,0.000006966779,0.00008622055,0.00009780613,0.002271673,0.001310896,0.984668,0.00301051,0.008353221],"study_design_scores_gemma":[0.00001852569,0.00001451418,0.00002857771,0.00000765183,0.000004908159,0.000077321,0.00002601341,0.01451877,0.0007412863,0.9794046,0.005146879,0.00001106089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2050523,0.008217677,0.4917541,0.0185327,0.00397372,0.0001321023,0.0003439841,0.002028029,0.2699654],"genre_scores_gemma":[0.9578642,0.001808206,0.02876836,0.0009161152,0.0008980028,0.00009884792,0.00005751272,0.0001185976,0.009470135],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006760251,"threshold_uncertainty_score":0.02261525,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1569419053","doi":"","title":"Fuzzy Automata and Languages: Theory and Applications","year":2002,"lang":"en","type":"book","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":296,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Tree-adjoining grammar; L-attributed grammar; Context-sensitive grammar; Embedded pushdown automaton; Probabilistic automaton; Context-free grammar; Indexed grammar; Mathematics; Nested word; Deterministic context-free grammar; Pushdown automaton; Quantum finite automata; Discrete mathematics; Automata theory; Computer science; Theoretical computer science; Finite-state machine; Programming language; Artificial intelligence; Rule-based machine translation; Automaton","authors":[{"name":"John N. Mordeson","is_ca":false},{"name":"Davender S. Malik","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007681325748701296,"gpt":0.2392440040577874,"spread":0.2315626783090861,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001552079,0.001196704,0.001957618,0.002898105,0.001517503,0.006162952,0.001690826,0.002806013,0.01212183],"category_scores_gemma":[0.003966625,0.0007190628,0.001708414,0.004521211,0.005278822,0.005705082,0.001639395,0.004343172,0.002088762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003447649,"about_ca_system_score_gemma":0.001976467,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005662888,"about_ca_topic_score_gemma":0.002420313,"domain_scores_codex":[0.9985839,0.0004689997,0.0001377279,0.000293595,0.000414925,0.0001007923],"domain_scores_gemma":[0.9976725,0.001377791,0.0001382286,0.0002039199,0.0005322888,0.00007526187],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007406168,0.0000109032,0.0001315247,0.0001664132,0.00001395613,0.00007547414,0.0003264899,0.002975044,0.0002373768,0.9724041,0.002982806,0.0206685],"study_design_scores_gemma":[0.000006034756,0.00001022599,0.0001433868,0.0001162151,0.000009420543,0.00009654358,0.0001308634,0.007517793,0.0000875867,0.9428199,0.04904748,0.00001452938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.01106455,0.123243,0.6869953,0.01002989,0.004114283,0.0002892446,0.001475152,0.0007914383,0.1619972],"genre_scores_gemma":[0.4127394,0.0888651,0.4095119,0.003948875,0.006648518,0.001586215,0.001909288,0.0002602368,0.07453055],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.01212183,"threshold_uncertainty_score":0.04055154,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984638028","doi":"10.1145/1400181.1400200","title":"The many facets of natural computing","year":2008,"lang":"en","type":"article","venue":"Communications of the ACM","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":240,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"National Science Foundation","keywords":"Natural computing; Natural (archaeology); Computer science; Natural science; Bridge (graph theory); Human–computer interaction; Artificial intelligence; Geology","authors":[{"name":"Lila Kari","is_ca":true},{"name":"Grzegorz Rozenberg","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03992601041239598,"gpt":0.2933581590792394,"spread":0.2534321486668434,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001986413,0.0004171326,0.0006623025,0.001947394,0.003760912,0.007846321,0.000977369,0.001799083,0.006422115],"category_scores_gemma":[0.008265181,0.0003626535,0.0006081322,0.003027753,0.01934829,0.0148442,0.004064573,0.004743029,0.001098967],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001741759,"about_ca_system_score_gemma":0.001921689,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002591536,"about_ca_topic_score_gemma":0.002762467,"domain_scores_codex":[0.9974182,0.00104947,0.00009873549,0.0003264328,0.0009162984,0.0001910007],"domain_scores_gemma":[0.9944517,0.003443514,0.0001750977,0.0009917617,0.0005215781,0.000416272],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001245382,0.000009278413,0.000350648,0.0001162686,0.0000103806,0.00006049593,0.0005422994,0.0005835037,0.0001862546,0.9728301,0.005612424,0.01968588],"study_design_scores_gemma":[0.000001888517,0.000003275048,0.0002116061,0.00005886073,0.000002431735,0.00006526594,0.0002902243,0.000831603,0.0000763374,0.9543897,0.04406078,0.000008026421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"review","genre_scores_codex":[0.02950204,0.09721778,0.2255933,0.133852,0.003565812,0.000135246,0.0005367511,0.0006092622,0.5089878],"genre_scores_gemma":[0.8057424,0.07597813,0.06613159,0.01228185,0.007365067,0.0003045726,0.0004008746,0.0002636948,0.03153188],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.007846321,"threshold_uncertainty_score":0.02148408,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068176031","doi":"10.1007/s11434-006-2012-5","title":"New field of cryptography: DNA cryptography","year":2006,"lang":"en","type":"article","venue":"Science Bulletin","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":184,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"National Natural Science Foundation of China","keywords":"Cryptography; DNA computing; Quantum cryptography; Financial cryptography; Computer science; Neural cryptography; Encryption; Theoretical computer science; Computer security; Public-key cryptography; Algorithm; Quantum information; Physics; Quantum","authors":[{"name":"Mingxin Lu","is_ca":false},{"name":"Lei Qin","is_ca":true},{"name":"Xuejia Lai","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00445660488723027,"gpt":0.2319371019555044,"spread":0.2274804970682742,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002993613,0.001257997,0.001785998,0.003826759,0.002416922,0.006201968,0.001143403,0.003267162,0.009055614],"category_scores_gemma":[0.006563975,0.0005046401,0.000751798,0.002959579,0.009274956,0.01158136,0.002196863,0.008480045,0.003081866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003765686,"about_ca_system_score_gemma":0.002154157,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006728861,"about_ca_topic_score_gemma":0.0005580531,"domain_scores_codex":[0.998417,0.0005296879,0.00008890338,0.0001839556,0.0006376161,0.0001428127],"domain_scores_gemma":[0.9954807,0.002461018,0.0002021667,0.0004257946,0.001113085,0.0003171427],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001006873,0.00004602664,0.0001671052,0.0004619322,0.00002905376,0.00006727601,0.0001727721,0.0005897576,0.0008455263,0.8583254,0.05949523,0.07969917],"study_design_scores_gemma":[0.00004322673,0.00008369049,0.0001691512,0.0002364304,0.00001981927,0.000270647,0.0001129885,0.001560767,0.0007850477,0.5838023,0.4128756,0.00004028705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"review","genre_gemma":"methods","genre_scores_codex":[0.005720479,0.4641422,0.1465882,0.09510557,0.05301045,0.0001206029,0.0003831631,0.0006448939,0.2342845],"genre_scores_gemma":[0.1888391,0.4547304,0.07492018,0.03349802,0.1590942,0.0003199089,0.0004455048,0.0004945003,0.08765832],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.009055614,"threshold_uncertainty_score":0.03029406,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966857768","doi":"10.1093/nar/gkg612","title":"RNAsoft: a suite of RNA secondary structure prediction and design software tools","year":2003,"lang":"en","type":"article","venue":"Nucleic Acids Research","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":149,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"RNA; Biology; Nucleic acid secondary structure; Protein secondary structure; Computational biology; Suite; DNA; Nucleic acid structure; Software; Software suite; Genetics; Computer science; Biochemistry; Gene; Programming language","authors":[{"name":"Mirela Andronescu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04990884701928244,"gpt":0.309198004975074,"spread":0.2592891579557915,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002049264,0.002639087,0.001977176,0.001983258,0.001167093,0.001904562,0.003082524,0.001478518,0.0145291],"category_scores_gemma":[0.003611479,0.002070496,0.002361583,0.001060835,0.0005014201,0.001530438,0.001205907,0.002875573,0.01057268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008264569,"about_ca_system_score_gemma":0.001591893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001882666,"about_ca_topic_score_gemma":0.003501941,"domain_scores_codex":[0.9988233,0.0002313983,0.0001513678,0.0002251297,0.0004881359,0.00008055461],"domain_scores_gemma":[0.9985008,0.0009357218,0.0001681226,0.0001127015,0.0002023728,0.00008038741],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001291657,0.0004454023,0.00538327,0.004988512,0.0009925305,0.001324184,0.0006936101,0.05965745,0.1187943,0.02646485,0.3077472,0.4722171],"study_design_scores_gemma":[0.0008670367,0.0004616106,0.003363293,0.0003933166,0.0004224932,0.00167412,0.0001558098,0.4656619,0.1335473,0.05398844,0.3389932,0.0004714208],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.006384586,0.001479796,0.7272424,0.0002643977,0.0002580407,0.0004044934,0.01267346,0.2458282,0.005464748],"genre_scores_gemma":[0.03073215,0.001547764,0.8978812,0.0004358619,0.00009561604,0.001860173,0.03266957,0.02731442,0.007463321],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.0145291,"threshold_uncertainty_score":0.04860473,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115404543","doi":"10.1016/j.tcs.2004.06.029","title":"Computationally universal P systems without priorities: two catalysts are sufficient","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":122,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Catalysis; Symbol (formal); Reduction (mathematics); P system; Power (physics); Mathematics; Computer science; Membrane computing; Chemistry; Theoretical computer science; Algorithm; Physics; Quantum mechanics","authors":[{"name":"Rudolf Freund","is_ca":false},{"name":"Lila Kari","is_ca":true},{"name":"Marion Oswald","is_ca":false},{"name":"Petr Sosı́k","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008116660906839171,"gpt":0.2500124413008852,"spread":0.241895780394046,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00393289,0.0008754711,0.001433651,0.001163233,0.002079382,0.00435049,0.002550323,0.003357817,0.01451935],"category_scores_gemma":[0.0295164,0.00110746,0.00123871,0.001009608,0.005181774,0.01103745,0.005474306,0.005095872,0.002096116],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001300819,"about_ca_system_score_gemma":0.003370016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001168053,"about_ca_topic_score_gemma":0.001209632,"domain_scores_codex":[0.9968728,0.0007158411,0.0002338277,0.0006820293,0.0005973991,0.0008980731],"domain_scores_gemma":[0.9784168,0.0133381,0.0007581531,0.004546063,0.001422667,0.00151824],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002642704,0.00004974623,0.0004807472,0.0001501536,0.00001849362,0.0001232049,0.0002149833,0.003949285,0.001208431,0.9792948,0.002526776,0.01171925],"study_design_scores_gemma":[0.00006642602,0.00002647001,0.00008470209,0.00002086455,0.00001428746,0.00008244577,0.00007172262,0.02084872,0.001544457,0.9753115,0.001908257,0.00002015096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2237018,0.001338887,0.6623636,0.01119105,0.0007322385,0.0003957996,0.001176278,0.002953844,0.09614651],"genre_scores_gemma":[0.9298352,0.000335623,0.06132489,0.0009328731,0.0001938253,0.000248982,0.0002840445,0.0003070711,0.006537395],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01451935,"threshold_uncertainty_score":0.04857212,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124920465","doi":"10.1093/bib/bbp064","title":"Simulation of P systems with active membranes on CUDA","year":2009,"lang":"en","type":"article","venue":"Briefings in Bioinformatics","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":79,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"CUDA; Computer science; Key (lock); Class (philosophy); Central processing unit; Membrane computing; Parallel computing; Computational science; Simulation; Computer architecture; Computer hardware; Operating system; Theoretical computer science; Artificial intelligence","authors":[{"name":"José M. Cecilia","is_ca":false},{"name":"José M. Garcı́a","is_ca":false},{"name":"Ginés D. Guerrero","is_ca":true},{"name":"Ignacio Pérez–Hurtado","is_ca":true},{"name":"Mario J. Pérez-Jímenez","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01213112504075233,"gpt":0.2458033272438325,"spread":0.2336722022030802,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004223478,0.0005112801,0.0007829958,0.0003557702,0.0008876477,0.001121557,0.001707371,0.001435367,0.002970775],"category_scores_gemma":[0.001812631,0.0004681069,0.0006394245,0.0006226099,0.0009128894,0.001018456,0.0008094519,0.0009619009,0.0003716736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001056649,"about_ca_system_score_gemma":0.001191907,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0102909,"about_ca_topic_score_gemma":0.003354201,"domain_scores_codex":[0.9997118,0.00008136896,0.00001970908,0.0000445829,0.00008092067,0.00006157952],"domain_scores_gemma":[0.9992937,0.0003076761,0.00004822889,0.0001150028,0.000152322,0.00008301422],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008374178,0.00005270654,0.0009976508,0.00005987375,0.00002942137,0.0001855458,0.0001406723,0.9749737,0.005366555,0.01253107,0.001066775,0.004512389],"study_design_scores_gemma":[0.00001813141,0.00001160064,0.00009752275,0.000002777907,0.000002301972,0.000012536,0.00001269777,0.9960598,0.001339468,0.001460361,0.0009769828,0.000005837798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6682876,0.0004591831,0.2986774,0.000822783,0.0002116262,0.0002125519,0.0009192394,0.003604732,0.02680497],"genre_scores_gemma":[0.9098971,0.0002621397,0.08403067,0.0001153432,0.00002385476,0.000331731,0.0005500353,0.0002563832,0.004532735],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0102909,"threshold_uncertainty_score":0.02046198,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2257571149","doi":"10.1007/s11432-007-0025-6","title":"Symmetric-key cryptosystem with DNA technology","year":2007,"lang":"en","type":"article","venue":"Science in China Series F Information Sciences","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":69,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"DNA computing; Cryptosystem; Encryption; Computer science; Symmetric-key algorithm; Cryptography; Key encapsulation; Key (lock); Theoretical computer science; Public-key cryptography; Computer security; Algorithm; Computation","authors":[{"name":"Mingxin Lu","is_ca":false},{"name":"Xuejia Lai","is_ca":false},{"name":"Lei Qin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007562128177110418,"gpt":0.2532331923620461,"spread":0.2456710641849357,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000912229,0.0005610366,0.0005556875,0.0007534071,0.0007781457,0.001383011,0.0006550312,0.0009896231,0.003565608],"category_scores_gemma":[0.001895509,0.0002920812,0.0003566905,0.001241557,0.001214285,0.003291854,0.00206525,0.001835343,0.001289559],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001204814,"about_ca_system_score_gemma":0.001791029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001922946,"about_ca_topic_score_gemma":0.0001503369,"domain_scores_codex":[0.998635,0.0003088696,0.0001000842,0.0002107346,0.0005442462,0.0002010108],"domain_scores_gemma":[0.9990626,0.0002918055,0.0001332133,0.0002820659,0.0001624731,0.00006786931],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009656452,0.0001970773,0.0007736405,0.000439598,0.00006743451,0.000351857,0.0002052871,0.01049068,0.06580509,0.7717998,0.00859387,0.14031],"study_design_scores_gemma":[0.0006966318,0.0006943276,0.0009087941,0.0001592282,0.0001343374,0.001410675,0.00009326032,0.09369102,0.1856749,0.6419024,0.0744907,0.0001436982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1881472,0.0051702,0.721133,0.007101891,0.001958801,0.0005194722,0.0007399252,0.001385571,0.07384397],"genre_scores_gemma":[0.9097248,0.001604552,0.06931141,0.0006581928,0.0006841345,0.0002237576,0.0003318795,0.00007015522,0.01739107],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003565608,"threshold_uncertainty_score":0.01192814,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2404127378","doi":"","title":"Radio Number for Square Paths.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":62,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Square (algebra); Statistics; Geometry","authors":[{"name":"Daphne Der‐Fen Liu","is_ca":false},{"name":"Melanie Xie","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01060503079864784,"gpt":0.2571862683527507,"spread":0.2465812375541028,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005104418,0.0005172806,0.0004449834,0.001693935,0.0009730235,0.002252741,0.0006698728,0.0007368873,0.03581395],"category_scores_gemma":[0.003995324,0.0001897288,0.0003021542,0.0009506675,0.001261948,0.002759519,0.001516633,0.00129343,0.008629655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008328485,"about_ca_system_score_gemma":0.0006332156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006154297,"about_ca_topic_score_gemma":0.0009338608,"domain_scores_codex":[0.9995753,0.00008211091,0.00002059988,0.0000945565,0.0001189829,0.0001084041],"domain_scores_gemma":[0.9986424,0.000638879,0.0001687305,0.0001625997,0.0001924955,0.000194985],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006618157,0.00001242327,0.0001468133,0.00006797294,0.000006481538,0.000051648,0.00007245169,0.0009963519,0.0008637407,0.966108,0.01275802,0.01884993],"study_design_scores_gemma":[0.00003279456,0.00005263224,0.0004319453,0.00004883477,0.00001252737,0.0002754462,0.00008687559,0.008242853,0.001332426,0.9284764,0.06098206,0.00002504395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1371548,0.003328894,0.2484055,0.006194497,0.002709952,0.0001280995,0.002102188,0.00134512,0.598631],"genre_scores_gemma":[0.7799116,0.001987436,0.05795636,0.001858319,0.001162917,0.0003117258,0.001072022,0.0004242467,0.1553153],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03581395,"threshold_uncertainty_score":0.1198096,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2076127862","doi":"10.1016/s0304-3975(02)00069-5","title":"Coding properties of DNA languages","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":61,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University; Saint Mary's University","funders":"","keywords":"DNA computing; Computation; Computer science; Decidability; Coding (social sciences); Theoretical computer science; Programming language; Mathematics","authors":[{"name":"Salah Hussini","is_ca":true},{"name":"Lila Kari","is_ca":true},{"name":"Stavros Konstantinidis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0133844404434226,"gpt":0.2452220632468246,"spread":0.231837622803402,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00121624,0.0003716902,0.0005385849,0.00216467,0.001393786,0.003567531,0.001003525,0.001110778,0.004733275],"category_scores_gemma":[0.01256385,0.000505013,0.0006308053,0.001791444,0.002391968,0.004846336,0.001409611,0.002241407,0.0005133019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001293075,"about_ca_system_score_gemma":0.0008686843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001028128,"about_ca_topic_score_gemma":0.0006799731,"domain_scores_codex":[0.9987745,0.0003373005,0.00007172541,0.0002017118,0.0003917664,0.0002231188],"domain_scores_gemma":[0.9808738,0.01554194,0.0008302228,0.001153365,0.001024584,0.0005762586],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004246695,0.00001524243,0.0004188992,0.00004155472,0.000004134669,0.00005754531,0.0003646917,0.002453734,0.002049007,0.9889603,0.0006447689,0.004947739],"study_design_scores_gemma":[0.0000115157,0.00001095155,0.0002235114,0.00001577282,0.000006363915,0.00009131528,0.00007113873,0.01395873,0.001609512,0.9830328,0.0009557341,0.00001284028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6949995,0.00106097,0.2249909,0.003298748,0.0001320837,0.00007576317,0.0009820537,0.0006156461,0.07384442],"genre_scores_gemma":[0.9853543,0.0002986562,0.009334018,0.000248987,0.0001666583,0.00009284828,0.0004159902,0.0001607066,0.003927786],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004733275,"threshold_uncertainty_score":0.01583433,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029929198","doi":"10.1016/j.jfranklin.2009.07.002","title":"Cyclic DNA codes over the ring <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>F</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo stretchy=\"false\">[</mml:mo><mml:mi>u</mml:mi><mml:mo stretchy=\"false\">]</mml:mo><mml:mo>/</mml:mo><mml:mo stretchy=\"false\">(</mml:mo><mml:msup><mml:mrow><mml:mi>u</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>-</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy=\"false\">)</mml:mo></mml:math> based on the deletion distance","year":2009,"lang":"lv","type":"article","venue":"Journal of the Franklin Institute","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":61,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Ring (chemistry); Set (abstract data type); Mathematics; DNA; Similarity (geometry); Minimum distance; Combinatorics; Genetics; Discrete mathematics; Computer science; Biology; Artificial intelligence; Chemistry; Image (mathematics)","authors":[{"name":"İrfan Şiap","is_ca":false},{"name":"Taher Abualrub","is_ca":false},{"name":"Ali Ghrayeb","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0160574690519091,"gpt":0.2378533661460158,"spread":0.2217958970941067,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003823223,0.0006215353,0.0003250374,0.0008817494,0.0007733473,0.001149806,0.0005350548,0.0004877485,0.05422411],"category_scores_gemma":[0.002248936,0.0002548229,0.0004161248,0.001196293,0.0006924852,0.001155426,0.0009141545,0.0007537553,0.02529097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001288846,"about_ca_system_score_gemma":0.001414272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004069175,"about_ca_topic_score_gemma":0.003808065,"domain_scores_codex":[0.9994568,0.00007743631,0.00004022764,0.0001165578,0.0001755892,0.000133337],"domain_scores_gemma":[0.9988145,0.0002672874,0.0001896044,0.000175434,0.0004310775,0.0001223075],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008789361,0.0001041338,0.001447598,0.0006382452,0.00002875822,0.000588736,0.0006287656,0.007823942,0.04367296,0.5593507,0.1581292,0.2267081],"study_design_scores_gemma":[0.0001609725,0.0003115014,0.002219537,0.0002547778,0.00003451045,0.0007338448,0.0003060708,0.01442172,0.07941116,0.1497636,0.7522458,0.0001364801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1395714,0.002141163,0.2913718,0.003699405,0.002424819,0.0004799683,0.0202703,0.01332487,0.5267162],"genre_scores_gemma":[0.5602995,0.0023037,0.1161292,0.001224866,0.0008355996,0.0005328532,0.01795389,0.003228023,0.2974923],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.05422411,"threshold_uncertainty_score":0.1813977,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4297474248","doi":"10.3390/s22197332","title":"Best Fit DNA-Based Cryptographic Keys: The Genetic Algorithm Approach","year":2022,"lang":"en","type":"article","venue":"Sensors","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":61,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brandon University","funders":"","keywords":"Cryptography; Crossover; Computer science; Key space; Redundancy (engineering); Population; Theoretical computer science; Key (lock); ENCODE; DNA computing; Algorithm; Biology; Computer security; Genetics; Artificial intelligence; Gene","authors":[{"name":"Pratyusa Mukherjee","is_ca":false},{"name":"Hitendra Garg","is_ca":false},{"name":"Chittaranjan Pradhan","is_ca":false},{"name":"Soumik Ghosh","is_ca":false},{"name":"S. Chowdhury","is_ca":false},{"name":"Gautam Srivastava","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01914973559302962,"gpt":0.2314581414857692,"spread":0.2123084058927396,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000823525,0.0005992833,0.0007039447,0.00114471,0.0004339021,0.0008622383,0.001153539,0.001259333,0.00136168],"category_scores_gemma":[0.002596639,0.0003147118,0.0006742956,0.0008545247,0.0009020082,0.001387883,0.0007951046,0.0009310955,0.0004337991],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007485556,"about_ca_system_score_gemma":0.0009372726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001103547,"about_ca_topic_score_gemma":0.001012316,"domain_scores_codex":[0.9994435,0.0001992555,0.00002262695,0.00009073084,0.0002001875,0.00004370068],"domain_scores_gemma":[0.9994797,0.0002710901,0.00005841901,0.00005849538,0.0001135441,0.00001874806],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007991533,0.00006413703,0.00106352,0.0001430409,0.0001010304,0.0001279977,0.0001366663,0.7565266,0.01438344,0.08304202,0.0008487506,0.1434828],"study_design_scores_gemma":[0.00002572982,0.00009799632,0.000184321,0.00002758002,0.00003227338,0.0001774843,0.00003363196,0.959856,0.004802019,0.03156156,0.003177201,0.00002419344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01942753,0.0007001979,0.9765736,0.0002301612,0.00005786304,0.00005897041,0.00002388189,0.0002188855,0.002708945],"genre_scores_gemma":[0.3357244,0.001129731,0.6583164,0.0001770443,0.00005226737,0.000222146,0.00008934907,0.00009523848,0.00419334],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00136168,"threshold_uncertainty_score":0.005431235,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2122157334","doi":"10.1007/978-1-4471-0313-4_15","title":"On P Systems with Active Membranes","year":2001,"lang":"en","type":"book-chapter","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":59,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Membrane; Computer science; Chemistry; Biochemistry","authors":[{"name":"Andrei Păun","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01441057272753299,"gpt":0.2162483272682789,"spread":0.201837754540746,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002122949,0.0007890821,0.0003904711,0.0004728441,0.001042015,0.001750931,0.0008170786,0.001037098,0.01282063],"category_scores_gemma":[0.0005556035,0.0003909835,0.0003343653,0.0008084491,0.001696074,0.004326785,0.001112191,0.00151751,0.004541378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006057991,"about_ca_system_score_gemma":0.0003840218,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005014184,"about_ca_topic_score_gemma":0.0004854248,"domain_scores_codex":[0.9998713,0.0000254074,0.000004944312,0.00002709627,0.00005061531,0.00002070954],"domain_scores_gemma":[0.9998924,0.00004743618,0.000005776243,0.00002519247,0.00002025817,0.000009022523],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004981055,0.000005355002,0.0000100185,0.00005254642,0.000001499139,0.00003993508,0.00006848248,0.0004030632,0.0006091531,0.9713898,0.009141751,0.01827336],"study_design_scores_gemma":[0.000003874333,0.000007724528,0.00002264511,0.00002535982,0.000002272825,0.0001243482,0.0000248332,0.001246208,0.0009431168,0.9016076,0.09598733,0.000004719564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.00762065,0.01289788,0.1066499,0.002599829,0.001554669,0.0000752759,0.0001275686,0.0004790802,0.8679951],"genre_scores_gemma":[0.2672597,0.02997622,0.05222457,0.002219194,0.001565018,0.0004149401,0.0002818014,0.0004265867,0.645632],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01282063,"threshold_uncertainty_score":0.0428893,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007496476","doi":"10.1016/j.biosystems.2007.06.002","title":"DNA approach to solve clustering problem based on a mutual order","year":2007,"lang":"en","type":"article","venue":"Biosystems","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Universiti Malaysia Pahang","keywords":"Cluster analysis; Computer science; Data mining; Correlation clustering; Clustering high-dimensional data; CURE data clustering algorithm; Fuzzy clustering; Theoretical computer science; Artificial intelligence","authors":[{"name":"R. A. Bakar","is_ca":false},{"name":"Junzo Watada","is_ca":false},{"name":"Witold Pedrycz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01746398095476364,"gpt":0.2456237060203725,"spread":0.2281597250656088,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008219163,0.0005496216,0.001171998,0.00167125,0.001246376,0.0006892795,0.00209135,0.001193064,0.002103658],"category_scores_gemma":[0.001874373,0.0003987911,0.00119715,0.001501866,0.0008353852,0.001617298,0.001299903,0.001006738,0.0004071172],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008824175,"about_ca_system_score_gemma":0.001271542,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005179475,"about_ca_topic_score_gemma":0.004855982,"domain_scores_codex":[0.9991575,0.0001994481,0.00004689615,0.0002334283,0.0002975006,0.00006512289],"domain_scores_gemma":[0.9990039,0.0004562896,0.00009211507,0.0001007859,0.0002885397,0.00005844044],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000229078,0.0001830089,0.001800918,0.0004000985,0.0002786415,0.0002156334,0.0005435453,0.5744568,0.01329612,0.1727631,0.004168894,0.2316642],"study_design_scores_gemma":[0.00001633645,0.00004921566,0.0002334422,0.00001011126,0.00002880902,0.00007095989,0.00003748167,0.9568425,0.00266462,0.0378935,0.002134153,0.00001877179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008933173,0.00016896,0.9896359,0.0001145727,0.00003177705,0.00003136096,0.00003862238,0.0001404729,0.0009052268],"genre_scores_gemma":[0.214048,0.0004211335,0.7778429,0.0001461135,0.0001210022,0.0002386144,0.0003382567,0.0001114451,0.006732496],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005179475,"threshold_uncertainty_score":0.01029861,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975121090","doi":"10.1142/s012905410200145x","title":"COMPUTING BY COMMUNICATION IN NETWORKS OF MEMBRANES","year":2002,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":52,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Membrane; Membrane computing; Computer science; Theoretical computer science; Mathematics; Chemistry; Biochemistry","authors":[{"name":"Andrei Păun","is_ca":true},{"name":"Gheorghe Pǎun","is_ca":false},{"name":"Grzegorz Rozenberg","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01656679589912971,"gpt":0.2873662264388591,"spread":0.2707994305397294,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009612884,0.0005070872,0.0008074878,0.0005290686,0.002117482,0.002616085,0.001172513,0.001619908,0.003298513],"category_scores_gemma":[0.003147248,0.0003205417,0.0009597282,0.0007876224,0.003834594,0.008022271,0.002725874,0.001435257,0.0005799005],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001250893,"about_ca_system_score_gemma":0.000815495,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001070149,"about_ca_topic_score_gemma":0.0007653423,"domain_scores_codex":[0.999079,0.0003641554,0.00004584213,0.0001725809,0.0001784323,0.0001599783],"domain_scores_gemma":[0.9989393,0.0005999972,0.00008920543,0.0002033155,0.00008730969,0.00008090704],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002246769,0.000008639395,0.00006280467,0.00004533926,0.000006699017,0.00005016072,0.00007470333,0.01833706,0.0007761228,0.9775506,0.0003469138,0.002718591],"study_design_scores_gemma":[0.00001681881,0.00001378838,0.00004153416,0.00001292924,0.000006531396,0.00005629264,0.00004289953,0.06003025,0.0007148396,0.9350234,0.004029554,0.0000110701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2649757,0.005023587,0.6306723,0.006564207,0.0006644758,0.000143603,0.0001809397,0.0004497505,0.09132545],"genre_scores_gemma":[0.8965641,0.002680126,0.0889413,0.0004433755,0.0002877463,0.0002427642,0.00012233,0.00008098227,0.01063724],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003298513,"threshold_uncertainty_score":0.01103467,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2796415147","doi":"10.1021/acssynbio.7b00363","title":"MIDAS: A Modular DNA Assembly System for Synthetic Biology","year":2018,"lang":"en","type":"article","venue":"ACS Synthetic Biology","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":51,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Ministry of Business, Innovation and Employment; Fulbright New Zealand; Alberta Agricultural Research Institute; University of Canterbury","keywords":"Synthetic biology; Modular design; Computational biology; Biology; DNA; Computer science; Genetics; Programming language","authors":[{"name":"Craig J. van Dolleweerd","is_ca":false},{"name":"Sarah A. Kessans","is_ca":false},{"name":"Kyle C. Van de Bittner","is_ca":false},{"name":"Leyla Y. Bustamante","is_ca":false},{"name":"Rudranuj Bundela","is_ca":false},{"name":"Barry Scott","is_ca":false},{"name":"Matthew J. Nicholson","is_ca":false},{"name":"Emily J. Parker","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01781519051785452,"gpt":0.2726757459853574,"spread":0.2548605554675029,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005152929,0.001324047,0.0007701592,0.0008975224,0.0005835526,0.0008340581,0.00139546,0.0006311429,0.00315759],"category_scores_gemma":[0.0004554366,0.0009202975,0.0007873991,0.0004369321,0.0003579963,0.0007966988,0.001063166,0.002244127,0.003715224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006411502,"about_ca_system_score_gemma":0.0005235521,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003407693,"about_ca_topic_score_gemma":0.0003652359,"domain_scores_codex":[0.9993814,0.00007460874,0.00005540915,0.0001427801,0.000283325,0.00006247559],"domain_scores_gemma":[0.9998061,0.0000338235,0.00004949511,0.00003346887,0.00002943853,0.00004766699],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002158652,0.00006652252,0.0002311541,0.0004441282,0.00003814889,0.0001654366,0.00007383565,0.002492429,0.9330287,0.006155164,0.003118869,0.05396977],"study_design_scores_gemma":[0.00005791903,0.0004045377,0.000447794,0.00004696657,0.00003982391,0.000831958,0.00001689825,0.01874558,0.8167988,0.00177091,0.1607534,0.00008528223],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03457843,0.001993493,0.9335942,0.0002078156,0.0004007333,0.0004680929,0.00171739,0.02354231,0.003497525],"genre_scores_gemma":[0.1355593,0.002279246,0.841816,0.0002759008,0.0001324797,0.001480872,0.007840689,0.001558582,0.00905693],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00315759,"threshold_uncertainty_score":0.01056319,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2471342003","doi":"","title":"On the design of codes for DNA computing","year":2006,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":51,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; DNA computing; Nucleic acid secondary structure; Code word; Hadamard transform; DNA; Computation; Algorithm; Theoretical computer science; Mathematics; Genetics; Biology; Decoding methods; RNA","authors":[{"name":"Olgica Milenković","is_ca":false},{"name":"Navin Kashyap","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0248825918359308,"gpt":0.2518797054783427,"spread":0.2269971136424118,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001293301,0.0006961889,0.0007532533,0.0008678173,0.00149014,0.002329093,0.001744792,0.001475625,0.003940609],"category_scores_gemma":[0.005803043,0.0005984574,0.000814497,0.00103477,0.002999113,0.002607411,0.002041619,0.001869987,0.001369103],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001352196,"about_ca_system_score_gemma":0.001451633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001644991,"about_ca_topic_score_gemma":0.002164161,"domain_scores_codex":[0.9989136,0.0003173435,0.00007890097,0.0001253956,0.000404597,0.0001600848],"domain_scores_gemma":[0.9980012,0.001074676,0.00009178562,0.0003418351,0.0003985297,0.00009198805],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008533575,0.00002483706,0.0001875596,0.000240418,0.00001911831,0.00004768322,0.00019683,0.05030039,0.00349669,0.8899212,0.003957299,0.05152272],"study_design_scores_gemma":[0.00004990798,0.00007273095,0.00006835072,0.0001527179,0.0000214121,0.00007838707,0.00007092543,0.1457938,0.008136132,0.7877122,0.05781054,0.00003278497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01593838,0.004114065,0.9485946,0.00167835,0.0005326539,0.0001398104,0.0001186517,0.0008658939,0.02801765],"genre_scores_gemma":[0.330824,0.00548122,0.6447693,0.0008802299,0.0003438065,0.0005170355,0.0003459787,0.000620326,0.01621815],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003940609,"threshold_uncertainty_score":0.01318264,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007924435","doi":"10.1016/j.biosystems.2006.12.009","title":"Stochastic P systems and the simulation of biochemical processes with dynamic compartments","year":2007,"lang":"en","type":"review","venue":"Biosystems","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":48,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique","keywords":"Computer science; Biological system; Computational biology; Biology","authors":[{"name":"Antoine Spicher","is_ca":false},{"name":"Olivier Michel","is_ca":false},{"name":"Mikolaj Cieslak","is_ca":true},{"name":"Jean‐Louis Giavitto","is_ca":false},{"name":"Przemysław Prusinkiewicz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04052884215604588,"gpt":0.3331897729596532,"spread":0.2926609308036073,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001118743,0.001400754,0.002068236,0.001099096,0.0004716464,0.001464606,0.002975969,0.002735338,0.001818247],"category_scores_gemma":[0.00204637,0.0007644341,0.0005878559,0.003738758,0.0034267,0.002616068,0.001373471,0.002920911,0.001364311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001468819,"about_ca_system_score_gemma":0.001522667,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002194386,"about_ca_topic_score_gemma":0.001517617,"domain_scores_codex":[0.9995024,0.0001523284,0.0000295421,0.00008860218,0.000202783,0.00002428674],"domain_scores_gemma":[0.9990053,0.0007323295,0.00004708967,0.00005567708,0.0001207409,0.00003890217],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007065127,0.00009187338,0.0003177211,0.003277815,0.0001088755,0.0002361029,0.0001216845,0.08759633,0.00294571,0.4426074,0.01778873,0.4448372],"study_design_scores_gemma":[0.00005386207,0.00007229654,0.0002280089,0.0006772981,0.00005325635,0.0006617302,0.00004598762,0.07869317,0.003180602,0.5622702,0.3540022,0.00006146762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.001935049,0.7828929,0.2007761,0.002055736,0.001120106,0.00003178928,0.00006413998,0.000248007,0.01087609],"genre_scores_gemma":[0.03447443,0.9024031,0.05447173,0.0007412462,0.00168986,0.0001288603,0.0001507213,0.00008070432,0.0058594],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.002975969,"threshold_uncertainty_score":0.01065713,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1876472356","doi":"10.1007/978-3-540-77962-9_29","title":"Watson-Crick Conjugate and Commutative Words","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":48,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Molecular Structure of Nucleic Acids: A Structure for Deoxyribose Nucleic Acid; Mathematics; Watson; Commutative property; Palindrome; Conjugacy class; Combinatorics on words; Complementarity (molecular biology); Combinatorics; Algebra over a field; Discrete mathematics; Pure mathematics; DNA; Computer science; Genome; Word (group theory); Base pair","authors":[{"name":"Lila Kari","is_ca":true},{"name":"Kalpana Mahalingam","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01654321535526889,"gpt":0.2488950887281109,"spread":0.232351873372842,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008341856,0.0008046562,0.0007626347,0.00158155,0.001813017,0.003864246,0.0009393172,0.001143458,0.01243434],"category_scores_gemma":[0.003997716,0.0005896186,0.0005406935,0.001945827,0.004060726,0.005199463,0.001571495,0.002119262,0.003625041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001068239,"about_ca_system_score_gemma":0.0007614524,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005314121,"about_ca_topic_score_gemma":0.0004158062,"domain_scores_codex":[0.9990282,0.0002289606,0.000065274,0.0001926123,0.0003803387,0.0001045984],"domain_scores_gemma":[0.9988565,0.0005101698,0.0001020835,0.0002062481,0.0002341259,0.00009090736],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006756207,0.000003456342,0.000009915187,0.00001005859,0.000001342155,0.00002677305,0.00006430727,0.0001620103,0.0002456743,0.9947245,0.0006846962,0.004060567],"study_design_scores_gemma":[0.00000346078,0.000006482208,0.0000170519,0.000005572208,0.000002178581,0.00007182384,0.00002958603,0.0006476675,0.0008818271,0.9883195,0.01000728,0.000007522405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.08573101,0.004420221,0.2894257,0.001510242,0.00239209,0.0001797663,0.0002790199,0.0004549606,0.615607],"genre_scores_gemma":[0.605,0.003715488,0.09221511,0.001076072,0.001272227,0.0004603007,0.0003068911,0.0005987557,0.2953552],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01243434,"threshold_uncertainty_score":0.04159701,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2132853600","doi":"10.1007/s11047-009-9131-2","title":"Watson–Crick palindromes in DNA computing","year":2009,"lang":"en","type":"article","venue":"Natural Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":47,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Palindrome; Molecular Structure of Nucleic Acids: A Structure for Deoxyribose Nucleic Acid; Catenation; Context (archaeology); Set (abstract data type); Mathematics; Combinatorics; Watson; Theory of computation; DNA computing; Sequence (biology); Discrete mathematics; Algebra over a field; Pure mathematics; DNA; Computer science; Base pair; Genome; Algorithm; Genetics; Biology","authors":[{"name":"Lila Kari","is_ca":true},{"name":"Kalpana Mahalingam","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009755713941148563,"gpt":0.2680295968948341,"spread":0.2582738829536856,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005070516,0.0002930019,0.000513942,0.0007102509,0.000934784,0.001614448,0.001010557,0.001044901,0.002945762],"category_scores_gemma":[0.003255399,0.0003804495,0.0002251249,0.001239099,0.002501273,0.00281018,0.0005899803,0.001712908,0.0006865934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007828041,"about_ca_system_score_gemma":0.0005303207,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001265558,"about_ca_topic_score_gemma":0.0007608562,"domain_scores_codex":[0.9995356,0.0001554975,0.00003517071,0.00008444308,0.0001458146,0.00004350718],"domain_scores_gemma":[0.999185,0.0004834996,0.0000600165,0.0001267941,0.0001006274,0.00004393205],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002808311,0.00001355651,0.00006232015,0.00006365617,0.000002687327,0.00008109312,0.0001009196,0.003849432,0.001545413,0.9778845,0.000854533,0.01551384],"study_design_scores_gemma":[0.000008091985,0.00001470634,0.00004209455,0.00002368349,0.0000035572,0.0001076273,0.00004483651,0.01414223,0.002423082,0.972403,0.01077548,0.00001164002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1926569,0.03757422,0.552388,0.008200251,0.002563151,0.0001518611,0.0002649658,0.0008715566,0.2053291],"genre_scores_gemma":[0.8620683,0.006165114,0.1131674,0.0005505192,0.0006935323,0.0001212,0.0001059153,0.0001402149,0.01698781],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002945762,"threshold_uncertainty_score":0.009854496,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2025553490","doi":"10.1007/s00236-003-0118-7","title":"Sticky-free and overhang-free DNA languages","year":2003,"lang":"en","type":"article","venue":"Acta Informatica","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":46,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Mary's University; Western University","funders":"","keywords":"DNA computing; Theory of computation; Computer science; Computation; DNA; Theoretical computer science; Set (abstract data type); Algorithm; Programming language; Genetics; Biology","authors":[{"name":"Lila Kari","is_ca":true},{"name":"Stavros Konstantinidis","is_ca":true},{"name":"Elena Losseva","is_ca":true},{"name":"Geoff Wozniak","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006728166659572096,"gpt":0.2258984392369812,"spread":0.2191702725774091,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001680263,0.0005451161,0.000632405,0.0009566306,0.00106476,0.002686517,0.001451969,0.001109975,0.008376155],"category_scores_gemma":[0.005474428,0.0005508282,0.0009531217,0.001566291,0.002200369,0.007443583,0.002858897,0.002561162,0.001788734],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008131434,"about_ca_system_score_gemma":0.001127896,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006535414,"about_ca_topic_score_gemma":0.0007777283,"domain_scores_codex":[0.9984453,0.0003155369,0.0002069385,0.0002602692,0.0005359965,0.0002359161],"domain_scores_gemma":[0.9958105,0.001937357,0.0002590215,0.001280723,0.0004631291,0.0002493345],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001955342,0.00002440401,0.0002380416,0.0001389717,0.00001254951,0.0001114681,0.0005258138,0.006780759,0.005112234,0.9393297,0.002991086,0.04453947],"study_design_scores_gemma":[0.00002839906,0.0000408041,0.0001078768,0.00004450461,0.00002113899,0.000215751,0.0001393865,0.01949979,0.01084843,0.9453318,0.02367434,0.00004776798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08109,0.001166316,0.8813997,0.001343917,0.0002862532,0.00007911362,0.0009963948,0.003089038,0.03054933],"genre_scores_gemma":[0.684597,0.001307809,0.2577662,0.00113717,0.0002326128,0.0003406503,0.001902929,0.002757751,0.04995802],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008376155,"threshold_uncertainty_score":0.02802104,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964440534","doi":"10.1023/b:joco.0000017385.39168.0d","title":"Exordium for DNA Codes","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Los Alamos National Laboratory; Francis Crick Institute; Alexander von Humboldt-Stiftung; University of California Berkeley; Laboratory Directed Research and Development; U.S. Department of Energy; University of Calgary; National Science Foundation","keywords":"Generalization; Computer science; Sequence (biology); DNA; Code (set theory); Theoretical computer science; Combinatorics; Mathematics; Discrete mathematics; Genetics; Biology; Programming language","authors":[{"name":"A.G. D'yachkov","is_ca":false},{"name":"Péter L. Erdős","is_ca":false},{"name":"Anthony J. Macula","is_ca":false},{"name":"David C. Torney","is_ca":false},{"name":"Chang‐Shung Tung","is_ca":false},{"name":"P.A. Vilenkin","is_ca":false},{"name":"Paul S. White","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01075103160510034,"gpt":0.2501131395328206,"spread":0.2393621079277203,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005790778,0.0005863749,0.0005797855,0.00100529,0.0009631858,0.001546086,0.001053313,0.0008301202,0.01320208],"category_scores_gemma":[0.003774264,0.000218986,0.0005880463,0.0009781375,0.00112932,0.001865525,0.002567719,0.001875265,0.003119666],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006877856,"about_ca_system_score_gemma":0.0005526999,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005329697,"about_ca_topic_score_gemma":0.000760949,"domain_scores_codex":[0.9993346,0.0002031702,0.00004267207,0.00009950815,0.0002212279,0.00009884503],"domain_scores_gemma":[0.9992323,0.0003190476,0.00004517627,0.0002263918,0.0001235966,0.00005352678],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006338455,0.00001735755,0.0001119653,0.00005961091,0.000006070932,0.00005123461,0.00005909576,0.003226752,0.0008753205,0.9347212,0.007003559,0.05380434],"study_design_scores_gemma":[0.00001262447,0.00002130276,0.00007222642,0.00003678535,0.00000623821,0.0001052101,0.00001767119,0.02327645,0.001501915,0.9451825,0.02975767,0.000009327316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03216536,0.001943507,0.8117452,0.002346967,0.001662986,0.0001020865,0.0005378927,0.001394477,0.1481016],"genre_scores_gemma":[0.5654153,0.001867887,0.3064361,0.001757711,0.001040151,0.0004486535,0.0009463429,0.001619424,0.1204684],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01320208,"threshold_uncertainty_score":0.04416531,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2989600529","doi":"10.1186/s13036-019-0211-2","title":"High capacity DNA data storage with variable-length Oligonucleotides using repeat accumulate code and hybrid mapping","year":2019,"lang":"en","type":"article","venue":"Journal of Biological Engineering","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":44,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"National University Health System; Nanyang Technological University; National University of Singapore; University of Alberta","keywords":"Computer science; Coding (social sciences); Computer data storage; Algorithm; Oligonucleotide; DNA; Computer hardware; Biology; Mathematics; Genetics","authors":[{"name":"Yixin Wang","is_ca":false},{"name":"Jingyun Zhang","is_ca":false},{"name":"Erry Gunawan","is_ca":false},{"name":"Yong Liang Guan","is_ca":false},{"name":"Chueh Loo Poh","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04411487236689308,"gpt":0.2336495960399167,"spread":0.1895347236730237,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002288824,0.0002417207,0.0001682724,0.0003610768,0.0002231518,0.000369143,0.0004796381,0.0003541658,0.0008622782],"category_scores_gemma":[0.0005369764,0.0001131064,0.0001809547,0.0003692984,0.0003563926,0.0004865178,0.0004630955,0.0002401455,0.0002607793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003831199,"about_ca_system_score_gemma":0.0002484207,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004564599,"about_ca_topic_score_gemma":0.0004691511,"domain_scores_codex":[0.999816,0.0000246938,0.00001448927,0.00003544795,0.00008522413,0.00002413466],"domain_scores_gemma":[0.9996104,0.0001025454,0.00009644396,0.00006351219,0.0000999472,0.00002718434],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001704713,0.00008974249,0.001029184,0.0002116461,0.00002444963,0.0002499307,0.0001794933,0.00602268,0.9552002,0.008054026,0.0003495579,0.02841871],"study_design_scores_gemma":[0.00001304389,0.000348423,0.000366183,0.00001477929,0.00001933055,0.0001800453,0.00002545608,0.0306408,0.9640341,0.0004838546,0.003843703,0.00003027664],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8639317,0.0009611432,0.1303644,0.0001975762,0.00009641786,0.00009508486,0.000126885,0.0008596627,0.003367242],"genre_scores_gemma":[0.9311281,0.0002808541,0.06623256,0.0000573967,0.00001294497,0.0000710866,0.0001036806,0.00002730432,0.002085863],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0008622782,"threshold_uncertainty_score":0.002884567,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2163677685","doi":"10.1016/s0304-3975(99)00100-0","title":"Using DNA to solve the Bounded Post Correspondence Problem","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":43,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Bounded function; Mathematics; Combinatorics; DNA; Discrete mathematics; Algorithm; Computer science; Algebra over a field; Genetics; Biology; Pure mathematics","authors":[{"name":"Lila Kari","is_ca":true},{"name":"Gregory B. Gloor","is_ca":true},{"name":"Sheng Yü","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01483284745428979,"gpt":0.2743296738512333,"spread":0.2594968263969435,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001105411,0.0005956142,0.0009442709,0.0005906907,0.001197705,0.001453671,0.001468524,0.002062964,0.007294358],"category_scores_gemma":[0.007571116,0.000395228,0.0007510064,0.0007979514,0.001938646,0.003368607,0.002799454,0.002441001,0.001149627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007530646,"about_ca_system_score_gemma":0.001328162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001139462,"about_ca_topic_score_gemma":0.001281461,"domain_scores_codex":[0.9992232,0.0002798627,0.00003177431,0.0001665212,0.0001852864,0.0001132785],"domain_scores_gemma":[0.996393,0.002750626,0.0001407383,0.0003932554,0.0002085371,0.0001138052],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004584897,0.0002022917,0.0004859428,0.0002257771,0.00003569414,0.0002173578,0.0002628091,0.1524587,0.006265682,0.739396,0.005941635,0.09404958],"study_design_scores_gemma":[0.00008413405,0.00006736162,0.00005822251,0.0000131953,0.000009404857,0.0000344855,0.00005225995,0.2789353,0.004264847,0.7134947,0.00297075,0.00001542053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1019085,0.0001956861,0.8764253,0.001511795,0.0002182624,0.00006768446,0.0001079897,0.0006912313,0.01887355],"genre_scores_gemma":[0.6219152,0.0001862818,0.3586424,0.0004575411,0.0001559359,0.0001917775,0.0003355544,0.0003452568,0.01777006],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007294358,"threshold_uncertainty_score":0.02440208,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1760096751","doi":"10.1007/s00200-013-0188-x","title":"Construction of cyclic codes over $$\\mathbb F _2+u\\mathbb F _2$$ F 2 + u F 2 for DNA computing","year":2013,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":42,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Complement (music); BCH code; Ring (chemistry); Constraint (computer-aided design); Combinatorics; Construct (python library); Physics; Mathematics; DNA; Discrete mathematics; Computer science; Chemistry; Decoding methods; Algorithm; Biology; Genetics; Computer network; Geometry","authors":[{"name":"Kenza Guenda","is_ca":true},{"name":"T. Aaron Gulliver","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005864888415478002,"gpt":0.222129005381761,"spread":0.216264116966283,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004181937,0.0006959991,0.0005913095,0.001068693,0.001296866,0.001173544,0.0007032278,0.0007272104,0.006456665],"category_scores_gemma":[0.001502167,0.0003085654,0.0008277821,0.001196246,0.001130885,0.0008758118,0.001999743,0.001322535,0.001602168],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001022984,"about_ca_system_score_gemma":0.002392324,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0016755,"about_ca_topic_score_gemma":0.0017241,"domain_scores_codex":[0.999325,0.0001030608,0.0000347603,0.0000959922,0.0002333317,0.0002077406],"domain_scores_gemma":[0.9992144,0.0002374776,0.00007550662,0.0001417438,0.000193259,0.0001376022],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000248446,0.0001409948,0.0005006032,0.0001608661,0.00002219619,0.0003330414,0.0003827771,0.005498643,0.02023611,0.9039397,0.01008261,0.05845407],"study_design_scores_gemma":[0.0001537694,0.0003774433,0.0006941417,0.0001262997,0.00006425817,0.0005149168,0.000221474,0.03700654,0.06271411,0.833627,0.06432294,0.0001771455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3140708,0.0008058098,0.5768645,0.001776097,0.001162514,0.0006854843,0.001748415,0.002767995,0.1001183],"genre_scores_gemma":[0.7841538,0.0005614913,0.178924,0.0007766224,0.000338293,0.0005443777,0.001794094,0.0006324674,0.03227493],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006456665,"threshold_uncertainty_score":0.02159971,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1875480853","doi":"10.1007/3-540-45711-9_21","title":"Codes, Involutions, and DNA Encodings","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":40,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"DNA computing; Computer science; Computation; DNA; Theoretical computer science; Encoding (memory); Algorithm; Computational problem; Artificial intelligence; Biology; Genetics","authors":[{"name":"Lila Kari","is_ca":true},{"name":"Rob Kitto","is_ca":true},{"name":"G. Thierrin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01680504986024873,"gpt":0.2307862610184788,"spread":0.2139812111582301,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005392596,0.0006018941,0.0005460323,0.001682407,0.001209484,0.003037955,0.0005766684,0.001242623,0.004377887],"category_scores_gemma":[0.003026199,0.0003039336,0.0003965669,0.002306937,0.004612472,0.003664873,0.001099066,0.002192932,0.0009662542],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001312551,"about_ca_system_score_gemma":0.0005315028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008108593,"about_ca_topic_score_gemma":0.0006647593,"domain_scores_codex":[0.9994856,0.0001692519,0.00003034967,0.00007903595,0.000169548,0.00006615097],"domain_scores_gemma":[0.9989374,0.0006903564,0.00007382339,0.0001483916,0.0001092186,0.0000408501],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005163599,0.000003400786,0.0000197193,0.00001864189,9.988313e-7,0.00001172475,0.00008009755,0.0003871045,0.0001183257,0.9888277,0.001515806,0.009011323],"study_design_scores_gemma":[0.000001747177,0.000003246334,0.00001856703,0.00001230443,8.770791e-7,0.00002695429,0.0000241859,0.0005226153,0.0001038249,0.9913668,0.00791579,0.000003195989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.08589145,0.08778747,0.2523354,0.01200138,0.003110206,0.00007677218,0.0006388676,0.0006468773,0.5575116],"genre_scores_gemma":[0.8176601,0.03181852,0.05352598,0.001479671,0.002947301,0.0002179439,0.0005993289,0.0001824132,0.09156873],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.004377887,"threshold_uncertainty_score":0.01464546,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1892760407","doi":"10.1109/spire.1999.796577","title":"Circular contextual insertions/deletions with applications to biomolecular computation","year":2003,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":40,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Computation; Rewriting; DNA computing; Computer science; DNA; Circular DNA; Theoretical computer science; Algorithm; Genetics; Biology; Genome; Programming language; Gene","authors":[{"name":"Mark Daley","is_ca":true},{"name":"Lila Kari","is_ca":true},{"name":"Gregory B. Gloor","is_ca":true},{"name":"Rani Siromoney","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01628470030553776,"gpt":0.2649685206745533,"spread":0.2486838203690156,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006545525,0.0004575171,0.000403262,0.0004334554,0.0007494839,0.001066658,0.0007143033,0.0008136077,0.002132768],"category_scores_gemma":[0.002063996,0.0002927459,0.0006106604,0.0005664906,0.002587208,0.001316284,0.001459381,0.000891658,0.0003565227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007682713,"about_ca_system_score_gemma":0.0005739029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009239959,"about_ca_topic_score_gemma":0.0008977259,"domain_scores_codex":[0.9993376,0.0001903964,0.00004287293,0.0001608966,0.0001836638,0.00008444407],"domain_scores_gemma":[0.9986632,0.0006387156,0.0001395472,0.0003396197,0.0001307872,0.00008817179],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001425862,0.00005836989,0.0005431338,0.0002020664,0.00001460843,0.0005543212,0.0005872178,0.04720129,0.04516459,0.8662001,0.0009047125,0.03842704],"study_design_scores_gemma":[0.0000427538,0.0001675665,0.0003278866,0.00005848018,0.00004830809,0.0009902754,0.0002560741,0.2567303,0.06460062,0.6442337,0.03247768,0.00006648961],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1307412,0.002577018,0.8469665,0.001136977,0.0002415962,0.00007960588,0.0000680454,0.00183618,0.01635285],"genre_scores_gemma":[0.8011926,0.001309215,0.1926098,0.00027246,0.0001948953,0.00007093096,0.00007093515,0.0002046654,0.004074487],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002132768,"threshold_uncertainty_score":0.007134855,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2120837895","doi":"10.1016/s0304-3975(03)00139-7","title":"Closure and decidability properties of some language classes with respect to ciliate bio-operations","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":36,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Closure (psychology); Decidability; Mathematics; Ciliate; Computer science; Discrete mathematics; Biology; Ecology; Political science","authors":[{"name":"Mark Daley","is_ca":true},{"name":"Óscar H. Ibarra","is_ca":false},{"name":"Lila Kari","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01103872080513999,"gpt":0.2451559344226615,"spread":0.2341172136175216,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004628723,0.0007345299,0.001473355,0.00255273,0.004538087,0.007981977,0.002701158,0.002370662,0.005936645],"category_scores_gemma":[0.01702565,0.001201348,0.004741452,0.001559934,0.005566904,0.01085711,0.003126657,0.005811253,0.0004080122],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003812845,"about_ca_system_score_gemma":0.002932992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004671209,"about_ca_topic_score_gemma":0.002744362,"domain_scores_codex":[0.9948454,0.0007302649,0.0004998335,0.001781072,0.0009494817,0.001193871],"domain_scores_gemma":[0.9672107,0.02537115,0.002298988,0.001619758,0.001584846,0.001914623],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001300383,0.0005581711,0.006768401,0.0003874401,0.0001693471,0.00149895,0.0057779,0.00881512,0.02453886,0.9277872,0.002885042,0.01951309],"study_design_scores_gemma":[0.0004489938,0.00017902,0.002708563,0.00007166165,0.0002047262,0.0009875016,0.001449933,0.0578487,0.02381115,0.9070899,0.005064163,0.0001356337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7668585,0.0005258746,0.2089808,0.003186741,0.0001800853,0.0002642701,0.001884997,0.001691955,0.01642688],"genre_scores_gemma":[0.9649026,0.0001799609,0.02818369,0.0003390764,0.0002465892,0.0002360342,0.001834359,0.0003351538,0.003742411],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007981977,"threshold_uncertainty_score":0.0276643,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W95475432","doi":"","title":"Handbook of Applied Algorithms: Solving Scientific, Engineering, and Practical Problems","year":2008,"lang":"en","type":"book","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":36,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Algorithm; Computer science; Graph theory; Identification (biology); Artificial intelligence; Mathematics","authors":[{"name":"Amiya Nayak","is_ca":false},{"name":"Ivan Stojmenović","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01732839738042495,"gpt":0.2297522499403364,"spread":0.2124238525599114,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004635912,0.002788218,0.002751074,0.00402134,0.001332253,0.00689186,0.003478153,0.004078792,0.03521028],"category_scores_gemma":[0.01600342,0.001515019,0.002202106,0.006428008,0.003490355,0.007089383,0.002680046,0.008490644,0.02204532],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001913255,"about_ca_system_score_gemma":0.00504161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001293499,"about_ca_topic_score_gemma":0.001185428,"domain_scores_codex":[0.9937716,0.001568913,0.0006853364,0.0007140767,0.003057325,0.00020284],"domain_scores_gemma":[0.9825022,0.01343491,0.0004775495,0.001199261,0.002125418,0.0002606003],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002962172,0.00008338023,0.0004250448,0.003321141,0.0001505757,0.0001334725,0.0003730578,0.01014492,0.0007837111,0.2800782,0.3223335,0.3821433],"study_design_scores_gemma":[0.00002011446,0.00004173229,0.0003060145,0.001010702,0.00002866427,0.0003736372,0.00008979914,0.01225474,0.00035579,0.1810658,0.8044081,0.00004502935],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001035208,0.1945723,0.6303946,0.01825589,0.01057297,0.000456586,0.001601541,0.003539071,0.1395717],"genre_scores_gemma":[0.0176079,0.2243355,0.6381006,0.008860779,0.01085583,0.001811083,0.002656282,0.002209673,0.09356239],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03521028,"threshold_uncertainty_score":0.1177901,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4414008559","doi":"10.1109/mcom.001.2400764","title":"Pushing Large Language Models to the 6G Edge: Vision, Challenges, and Opportunities","year":2025,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":36,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of Hong Kong; Research Grants Council, University Grants Committee; Cancer Research Society","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Artificial intelligence; Human–computer interaction; Telecommunications; Computer vision; Computer graphics (images)","authors":[{"name":"Zheng Lin","is_ca":false},{"name":"Guanqiao Qu","is_ca":false},{"name":"Qiyuan Chen","is_ca":false},{"name":"Xianhao Chen","is_ca":false},{"name":"Zhe Chen","is_ca":false},{"name":"Kaibin Huang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07353448083784425,"gpt":0.3204168409315371,"spread":0.2468823600936928,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005425345,0.001184495,0.00120276,0.0006195684,0.0009509542,0.003985176,0.003374068,0.002801704,0.003414927],"category_scores_gemma":[0.01581752,0.0008677594,0.0008443475,0.0008538126,0.002318599,0.01097446,0.005437668,0.007106656,0.002532529],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001369008,"about_ca_system_score_gemma":0.002112335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004576453,"about_ca_topic_score_gemma":0.007641797,"domain_scores_codex":[0.9975007,0.001254427,0.00007731895,0.0004206749,0.0004715354,0.0002754352],"domain_scores_gemma":[0.9923453,0.004216523,0.0002534726,0.001865662,0.0008812361,0.0004378891],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005976079,0.0002852399,0.005605475,0.0004396557,0.0002227252,0.0008536444,0.001389874,0.235087,0.0139051,0.283283,0.0459237,0.412407],"study_design_scores_gemma":[0.00002709296,0.00007963495,0.0003154725,0.00006938951,0.00002951359,0.0001687453,0.0003313528,0.7742261,0.003698732,0.1986763,0.02233966,0.00003791116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.02335444,0.002725863,0.9402874,0.02210771,0.0003343509,0.0000754865,0.0003511002,0.003122125,0.007641635],"genre_scores_gemma":[0.5752925,0.00388776,0.4021875,0.00788286,0.0008253027,0.0002131976,0.001236828,0.0007338568,0.007740284],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.005425345,"threshold_uncertainty_score":0.02869231,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1983239548","doi":"10.1016/j.tcs.2004.12.032","title":"On properties of bond-free DNA languages","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Mary's University; Western University","funders":"Grantová Agentura České Republiky; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"DNA; DNA computing; Construct (python library); Property (philosophy); Characterization (materials science); Formal language; Computer science; Discrete mathematics; Mathematics; Algorithm; Theoretical computer science; Programming language; Genetics; Biology; Physics","authors":[{"name":"Lila Kari","is_ca":true},{"name":"Stavros Konstantinidis","is_ca":true},{"name":"Petr Sosı́k","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009223273731269854,"gpt":0.2389336360263328,"spread":0.229710362295063,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004060988,0.0009676185,0.001278254,0.002792752,0.002836504,0.005012572,0.00256612,0.002029455,0.008774363],"category_scores_gemma":[0.02748313,0.0009230399,0.001408157,0.003108191,0.005988147,0.01621606,0.003435011,0.00487083,0.0009180725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002427089,"about_ca_system_score_gemma":0.001233123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001258184,"about_ca_topic_score_gemma":0.0009298752,"domain_scores_codex":[0.9977849,0.0007446934,0.0001793792,0.0003605573,0.0005846616,0.0003458463],"domain_scores_gemma":[0.9561208,0.03682254,0.001683466,0.002654106,0.001510858,0.001208256],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007309649,0.000031499,0.0003392352,0.00005730606,0.000009561481,0.00005763244,0.0003841234,0.004013727,0.0007022601,0.9891098,0.0009509993,0.00427082],"study_design_scores_gemma":[0.00001234854,0.00001221349,0.00006257987,0.0000140068,0.000005829384,0.00004215268,0.00005544057,0.007636902,0.0002976659,0.9911084,0.0007431646,0.000009284438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4802723,0.002778989,0.4122334,0.007910666,0.0003522767,0.0001677073,0.001017262,0.0010707,0.09419669],"genre_scores_gemma":[0.956813,0.001253526,0.02904082,0.0009192619,0.0004448178,0.0003300899,0.0007129533,0.0005306479,0.009954922],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008774363,"threshold_uncertainty_score":0.0293532,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2079582928","doi":"10.1016/j.tcs.2009.05.001","title":"On the descriptional complexity of Watson–Crick automata","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":32,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University; Western University","funders":"","keywords":"Watson; Automaton; Molecular Structure of Nucleic Acids: A Structure for Deoxyribose Nucleic Acid; Unary operation; Automata theory; Mathematics; Finite-state machine; Regular language; DFA minimization; Deterministic finite automaton; Discrete mathematics; Quantum finite automata; Combinatorics; Computer science; Theoretical computer science; Algorithm; DNA; Base pair","authors":[{"name":"Elena Czeizler","is_ca":true},{"name":"Eugen Czeizler","is_ca":true},{"name":"Lila Kari","is_ca":true},{"name":"Kai Salomaa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03009187934474768,"gpt":0.2660095653318389,"spread":0.2359176859870912,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003390715,0.0008194502,0.001676488,0.001781445,0.001947361,0.00523097,0.003007132,0.002475805,0.005328047],"category_scores_gemma":[0.0296207,0.001054794,0.001469446,0.00227882,0.005090517,0.01363766,0.00348749,0.005719447,0.0005397316],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003698106,"about_ca_system_score_gemma":0.001375514,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003205558,"about_ca_topic_score_gemma":0.00155013,"domain_scores_codex":[0.9963723,0.001281843,0.0002446032,0.0004086158,0.001282732,0.0004098205],"domain_scores_gemma":[0.9662905,0.02835301,0.001134237,0.002306516,0.001359429,0.0005562892],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003972096,0.00002661929,0.0003543033,0.00007127001,0.00001537049,0.00005614448,0.0001748629,0.02691694,0.0003152889,0.9660922,0.001120204,0.004817087],"study_design_scores_gemma":[0.000006029672,0.000004578688,0.00009054307,0.00001136831,0.000004708344,0.0000221992,0.00003050263,0.0560027,0.000132749,0.9431762,0.00050725,0.00001121178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4241968,0.007214922,0.4395399,0.0197075,0.0005399899,0.0001515286,0.001269859,0.0004749602,0.1069045],"genre_scores_gemma":[0.9696733,0.00184416,0.02190573,0.0004471378,0.0004057573,0.0001491224,0.0005397795,0.0001455038,0.004889462],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005328047,"threshold_uncertainty_score":0.02683181,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985614194","doi":"10.1016/j.tcs.2005.09.016","title":"Simple permutations mix well","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of British Columbia","funders":"","keywords":"Random permutation; Mathematics; Combinatorics; Permutation (music); Simple (philosophy); Independence (probability theory); Closeness; Mixing (physics); Random graph; Discrete mathematics; Derangement; Graph; Symmetric group; Statistics","authors":[{"name":"Shlomo Hoory","is_ca":true},{"name":"Avner Magen","is_ca":true},{"name":"Steven Myers","is_ca":false},{"name":"Charles Rackoff","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008061903686414422,"gpt":0.2620267867829475,"spread":0.2539648830965331,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00153033,0.001565923,0.00177521,0.003291487,0.003843175,0.005722474,0.001054507,0.003089319,0.02507497],"category_scores_gemma":[0.007706684,0.001027707,0.001501055,0.002433114,0.004131462,0.01037266,0.004740556,0.004057437,0.007156474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001098553,"about_ca_system_score_gemma":0.000865993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004373763,"about_ca_topic_score_gemma":0.0009629109,"domain_scores_codex":[0.9971938,0.000759339,0.0001253549,0.0005359161,0.0008152315,0.0005701985],"domain_scores_gemma":[0.9959441,0.001615311,0.0002998726,0.001078251,0.000529261,0.0005331628],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005044211,0.00002299963,0.000140633,0.00002815841,0.00001408163,0.00005926762,0.0001078221,0.0003941636,0.0009638455,0.9863917,0.002882279,0.00894463],"study_design_scores_gemma":[0.00001144836,0.00001206769,0.00008900067,0.000009034263,0.000009628761,0.0000921653,0.0000408896,0.001649183,0.0006626182,0.9917644,0.005646415,0.00001311125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2008644,0.001768561,0.3137888,0.00560135,0.001517704,0.0003529206,0.0009164163,0.002706139,0.4724838],"genre_scores_gemma":[0.8129088,0.001159108,0.04421946,0.002237876,0.0007990439,0.0004568873,0.0007145291,0.00136537,0.1361388],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02507497,"threshold_uncertainty_score":0.08388412,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2074437394","doi":"10.1109/tit.2012.2191682","title":"Bounds on the Capacity of Discrete Memoryless Channels Corrupted by Synchronization and Substitution Errors","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Synchronization (alternating current); Channel capacity; Independent and identically distributed random variables; Channel (broadcasting); Upper and lower bounds; Noise (video); Mathematics; Topology (electrical circuits); Computer science; Algorithm; Random variable; Combinatorics; Telecommunications; Statistics","authors":[{"name":"Hugues Mercier","is_ca":true},{"name":"Vahid Tarokh","is_ca":false},{"name":"Fabrice Labeau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01290173147699545,"gpt":0.2245494277444444,"spread":0.2116476962674489,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003041829,0.001314388,0.001344362,0.001793803,0.001038873,0.003205561,0.002283593,0.001612468,0.00454247],"category_scores_gemma":[0.02931154,0.0006430532,0.0007663676,0.001460815,0.005630503,0.005687729,0.002805754,0.002972804,0.0005878917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003076206,"about_ca_system_score_gemma":0.001796456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00242272,"about_ca_topic_score_gemma":0.001078162,"domain_scores_codex":[0.9976299,0.0006393933,0.00009462354,0.0002957746,0.000676512,0.000663847],"domain_scores_gemma":[0.962811,0.0307245,0.001498648,0.002397248,0.001925808,0.0006428531],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001868486,0.00006051784,0.0004691705,0.0002050835,0.00004174371,0.000159663,0.0001758452,0.6036937,0.005376458,0.3810078,0.001677071,0.006946168],"study_design_scores_gemma":[0.00001461545,0.00002126806,0.0001118494,0.00005333537,0.00001351512,0.0000468797,0.0000340591,0.8658103,0.002996858,0.1303072,0.0005611571,0.00002879794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1847484,0.002541421,0.7712181,0.002690885,0.0002669823,0.00007931466,0.000889186,0.0008697083,0.03669604],"genre_scores_gemma":[0.9704601,0.001176082,0.02387692,0.0002342662,0.0001804096,0.0001841722,0.0002850108,0.0001705414,0.003432587],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00454247,"threshold_uncertainty_score":0.02231956,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2042079117","doi":"10.1016/s0304-3975(02)00853-8","title":"A recognition and parsing algorithm for arbitrary conjunctive grammars","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"L-attributed grammar; Parsing expression grammar; Indexed grammar; Context-free grammar; Parsing; Computer science; Phrase structure grammar; Context-sensitive grammar; Time complexity; Algorithm; Tree-adjoining grammar; Rule-based machine translation; Definite clause grammar; Mathematics; Theoretical computer science; Programming language; Artificial intelligence","authors":[{"name":"Alexander Okhotin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01796921826556223,"gpt":0.2474809605047613,"spread":0.2295117422391991,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00117872,0.001244697,0.00151483,0.00131016,0.001521416,0.003141669,0.002745762,0.002302095,0.01185325],"category_scores_gemma":[0.003782851,0.00152701,0.002047984,0.002106949,0.001264807,0.005136888,0.002854632,0.002754296,0.005096169],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001153489,"about_ca_system_score_gemma":0.002048393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003821379,"about_ca_topic_score_gemma":0.004961075,"domain_scores_codex":[0.9988227,0.0001745288,0.0001216587,0.000467248,0.0002777485,0.0001359483],"domain_scores_gemma":[0.9980378,0.001102007,0.0000584326,0.0003931515,0.0003377178,0.00007092051],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003451713,0.0002575688,0.000832524,0.0003051672,0.00009835047,0.0004324108,0.0005250148,0.02167277,0.02381966,0.07948453,0.02691817,0.8453088],"study_design_scores_gemma":[0.0001927444,0.0001115203,0.0007224596,0.000084874,0.0001916194,0.000806444,0.0002698691,0.6838999,0.05866334,0.221762,0.03315092,0.0001443316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007261025,0.000116283,0.9744124,0.0002155874,0.0000624039,0.0001070766,0.0003094877,0.015215,0.002300756],"genre_scores_gemma":[0.058798,0.0001062476,0.9343457,0.000171396,0.0000356609,0.0001418547,0.001500629,0.001554083,0.003346417],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01185325,"threshold_uncertainty_score":0.03965306,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1484840002","doi":"","title":"Membrane systems with coupled transport: universality and normal forms","year":2002,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Universality (dynamical systems); Membrane; Membrane computing; Turing; Symporter; Molecule; Antiporter; Turing machine; Membrane transport; Computation; Chemistry; Computer science; Theoretical computer science; Physics; Algorithm; Quantum mechanics; Biochemistry","authors":[{"name":"Carlos Martı́n-Vide","is_ca":false},{"name":"Andrei Păun","is_ca":true},{"name":"Gheorghe Pǎun","is_ca":false},{"name":"Grzegorz Rozenberg","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0116261369136358,"gpt":0.1937117161132927,"spread":0.182085579199657,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001573648,0.0006483591,0.000872257,0.001952446,0.001336382,0.003034768,0.0009614071,0.001513278,0.003578418],"category_scores_gemma":[0.007495468,0.0005655837,0.001288905,0.0009713596,0.00674746,0.007080286,0.004525806,0.002327678,0.0004629803],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002032576,"about_ca_system_score_gemma":0.0007887396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00103009,"about_ca_topic_score_gemma":0.0005084079,"domain_scores_codex":[0.9978777,0.0005850299,0.0001526983,0.0004558939,0.0005687224,0.0003599453],"domain_scores_gemma":[0.9964876,0.001838512,0.0003647155,0.0004162438,0.000507039,0.0003859702],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004573589,0.000005903572,0.0001188714,0.00002141793,0.00000469424,0.0000527574,0.0002221286,0.001717952,0.0003803844,0.9958301,0.0001543057,0.001486888],"study_design_scores_gemma":[0.000005532265,0.00000747745,0.00006293922,0.000007833057,0.000002817602,0.00008102314,0.00004574831,0.01233787,0.0002354287,0.986482,0.000722624,0.000008703334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5442711,0.002421387,0.3648739,0.003157289,0.000257349,0.0001623875,0.0002513308,0.0006410174,0.08396439],"genre_scores_gemma":[0.9748975,0.0006828,0.01823173,0.0001641423,0.0001851929,0.00009113443,0.00008136682,0.00008631693,0.005579645],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003578418,"threshold_uncertainty_score":0.01474744,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2085202968","doi":"10.1016/j.tcs.2004.06.028","title":"Template-guided DNA recombination","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":28,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University; University of Saskatchewan","funders":"","keywords":"Recombination; DNA; Gene; Genome; Genetics; Process (computing); Computer science; Computational biology; Biology; Theoretical computer science; Computation; Algorithm; Programming language","authors":[{"name":"Mark Daley","is_ca":true},{"name":"Ian McQuillan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01405394857149718,"gpt":0.2674203274528775,"spread":0.2533663788813803,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004392484,0.0003896404,0.0006603285,0.0003922083,0.0004210777,0.0009832291,0.001317949,0.001371508,0.005587421],"category_scores_gemma":[0.001360132,0.0003617099,0.0005503264,0.0005511086,0.0006903181,0.0007598842,0.001120711,0.001376845,0.002168197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000499056,"about_ca_system_score_gemma":0.0003127911,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002456993,"about_ca_topic_score_gemma":0.0002559481,"domain_scores_codex":[0.9996731,0.00007851179,0.00001061628,0.0000823002,0.0001107617,0.00004470532],"domain_scores_gemma":[0.999577,0.0001847634,0.00003589856,0.0001290995,0.00003506115,0.00003828166],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005161693,0.0002268883,0.0005191378,0.0003025617,0.00008122175,0.0002513588,0.0003066827,0.1094609,0.2041777,0.4340793,0.008411042,0.241667],"study_design_scores_gemma":[0.0001260587,0.0001899612,0.0003064719,0.00003531352,0.000042871,0.0004519001,0.00004575089,0.663031,0.1397732,0.1646259,0.03131609,0.00005560775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0936119,0.002115149,0.8524664,0.0006377372,0.0004384408,0.000136598,0.0001434954,0.002537603,0.04791264],"genre_scores_gemma":[0.7772965,0.001063643,0.1871629,0.0003392019,0.00007658507,0.0001546468,0.0003597169,0.0005157465,0.03303099],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005587421,"threshold_uncertainty_score":0.01869184,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1553144061","doi":"10.1007/11753681_12","title":"Hairpin Structures in DNA Words","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Mary's University; Western University","funders":"","keywords":"DNA computing; Computer science; DNA; Algebraic structure; Algorithm; Algebraic properties; Discrete mathematics; Mathematics; Biology; Genetics; Pure mathematics","authors":[{"name":"Lila Kari","is_ca":true},{"name":"Stavros Konstantinidis","is_ca":true},{"name":"Elena Losseva","is_ca":true},{"name":"Petr Sosı́k","is_ca":false},{"name":"G. Thierrin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01126963481184999,"gpt":0.2392232831598932,"spread":0.2279536483480432,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000186287,0.0003551192,0.0004026777,0.0009705737,0.001119101,0.00186671,0.0004938841,0.0008418362,0.01213785],"category_scores_gemma":[0.001192161,0.0003458088,0.0003148396,0.001223607,0.00140554,0.002676324,0.0008268401,0.001079052,0.002876852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005432193,"about_ca_system_score_gemma":0.0002922734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002452355,"about_ca_topic_score_gemma":0.0003517133,"domain_scores_codex":[0.9997658,0.00006565652,0.00001384604,0.00004737968,0.00007019346,0.00003708231],"domain_scores_gemma":[0.9996417,0.0001652983,0.00004022902,0.00005208763,0.00006335453,0.00003724147],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001478263,0.000008297128,0.00004209725,0.000031299,0.000001620744,0.00005405946,0.0002441891,0.0005346892,0.001401161,0.9834484,0.002283449,0.01193602],"study_design_scores_gemma":[0.00000602206,0.00002474364,0.00008131703,0.00002599844,0.000003229684,0.0001147678,0.000152461,0.002610732,0.001572976,0.9650581,0.03034149,0.000008088248],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.1622071,0.009574438,0.2670743,0.00298555,0.002435106,0.000196117,0.000583006,0.001100102,0.5538444],"genre_scores_gemma":[0.7962689,0.00315866,0.06568372,0.000850102,0.001010001,0.0002325058,0.0007508874,0.0004578135,0.1315875],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.01213785,"threshold_uncertainty_score":0.04060519,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2099378738","doi":"10.1142/s0129054105003467","title":"BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Mary's University; Western University","funders":"","keywords":"Decidability; Discrete mathematics; Characterization (materials science); Property (philosophy); Mathematics; Context (archaeology); Hamming code; Hamming distance; Computer science; Combinatorics; Algorithm; Block code","authors":[{"name":"Lila Kari","is_ca":true},{"name":"Stavros Konstantinidis","is_ca":true},{"name":"Petr Sosı́k","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01543495050001134,"gpt":0.3606698463397361,"spread":0.3452348958397248,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003837388,0.001048785,0.0007021825,0.001288566,0.001189452,0.003011179,0.002935264,0.001465676,0.004387895],"category_scores_gemma":[0.009299863,0.00128112,0.00239147,0.001571694,0.007583271,0.008656438,0.002874356,0.004615746,0.001097752],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002487294,"about_ca_system_score_gemma":0.001593395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009092145,"about_ca_topic_score_gemma":0.000702324,"domain_scores_codex":[0.9962196,0.001122743,0.0004840948,0.0009228354,0.0009408554,0.0003099926],"domain_scores_gemma":[0.9921968,0.005465785,0.0006559805,0.0009598845,0.0005077651,0.0002138589],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001280853,0.00001635543,0.0001115739,0.0001002228,0.000005892722,0.00004018037,0.0002977514,0.004798805,0.001284007,0.9838915,0.0004131247,0.009027801],"study_design_scores_gemma":[0.00001525131,0.00002167768,0.0000380861,0.00005441013,0.00001318161,0.0001582411,0.00009775991,0.02420735,0.004993729,0.9611112,0.009261652,0.00002741134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01031982,0.0005542471,0.981185,0.0004966009,0.00004460609,0.00008423526,0.000126417,0.0004248814,0.006764083],"genre_scores_gemma":[0.3563732,0.001423494,0.6301095,0.0005098231,0.0002209852,0.001049596,0.0005965875,0.0007785537,0.008938221],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004387895,"threshold_uncertainty_score":0.02029431,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2162572810","doi":"10.1016/s0304-3975(99)00277-7","title":"Shuffle and scattered deletion closure of languages","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Closure (psychology); Computer science; Programming language; Mathematics; Linguistics; Combinatorics; Philosophy; Political science","authors":[{"name":"Masami Itō","is_ca":false},{"name":"Lila Kari","is_ca":true},{"name":"G. Thierrin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004512639951644926,"gpt":0.2419252014596633,"spread":0.2374125615080183,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002059928,0.0006774014,0.001628735,0.001733071,0.003359817,0.003866692,0.001683875,0.001341256,0.006853005],"category_scores_gemma":[0.009277089,0.0008032898,0.001607871,0.001892543,0.004663436,0.009589749,0.00502745,0.003366341,0.0008655319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001405557,"about_ca_system_score_gemma":0.00112581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001020895,"about_ca_topic_score_gemma":0.0008482287,"domain_scores_codex":[0.9980562,0.0004012576,0.0001727297,0.0004642279,0.00044008,0.0004654971],"domain_scores_gemma":[0.9912462,0.005128079,0.0006380923,0.001335486,0.0008272228,0.000824931],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001225967,0.00002494426,0.0002408201,0.00003021729,0.000007674465,0.000190139,0.0005104272,0.0013908,0.001082576,0.9896765,0.0006429873,0.006080267],"study_design_scores_gemma":[0.00002892953,0.00002240226,0.00008935875,0.000008183907,0.000008167658,0.0002064097,0.0001158378,0.00333212,0.001229828,0.9934165,0.001528285,0.00001399056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5115188,0.000595488,0.4431534,0.001457882,0.0002346408,0.00008936602,0.0005862737,0.001256546,0.04110773],"genre_scores_gemma":[0.9507605,0.0002340429,0.0313531,0.0003522505,0.0001566152,0.0001213235,0.0004770451,0.0004730141,0.01607194],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006853005,"threshold_uncertainty_score":0.02292562,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029114055","doi":"10.1109/tit.2004.830782","title":"Monotonicity-Based Fast Algorithms for MAP Estimation of Markov Sequences Over Noisy Channels","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Maximum a posteriori estimation; Algorithm; Markov chain; Mathematics; Decoding methods; Computational complexity theory; Sequence (biology); Directed acyclic graph; Forward algorithm; Monotonic function; Markov model; Variable-order Markov model","authors":[{"name":"Xiaolin Wu","is_ca":true},{"name":"Sorina Dumitrescu","is_ca":true},{"name":"Z. Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01048673774791291,"gpt":0.2543342481356515,"spread":0.2438475103877386,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002414417,0.001489833,0.001325008,0.001466689,0.0007236669,0.001319279,0.002113448,0.001526411,0.003126715],"category_scores_gemma":[0.01498206,0.0009297334,0.001166186,0.00162038,0.001615674,0.003927223,0.002701248,0.003074709,0.001093114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001082236,"about_ca_system_score_gemma":0.001809157,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002288255,"about_ca_topic_score_gemma":0.002053514,"domain_scores_codex":[0.9982871,0.0007070882,0.0001026811,0.0003258506,0.0004366326,0.0001405705],"domain_scores_gemma":[0.9896051,0.008242859,0.0005243298,0.0006267405,0.0008616613,0.0001392954],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002969264,0.0001150976,0.0006871143,0.0003489809,0.00009523743,0.0001459517,0.000307175,0.5501659,0.009481467,0.2210562,0.002782968,0.2145169],"study_design_scores_gemma":[0.00001625247,0.00004342718,0.00006512463,0.00001674752,0.000007381814,0.00004173381,0.00001558364,0.9547666,0.001938865,0.04199309,0.001080539,0.0000146851],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002392155,0.0001274212,0.9964821,0.0000885534,0.00001993758,0.00003090158,0.00003279668,0.0001485353,0.0006775614],"genre_scores_gemma":[0.1181256,0.0007124204,0.8777672,0.0001825885,0.0001504757,0.0003727019,0.0003065789,0.000222587,0.002159861],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003126715,"threshold_uncertainty_score":0.01276881,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3141810508","doi":"","title":"DNA computing: the arrival of biological mathematics","year":2008,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Mathematical and theoretical biology; Simple (philosophy); Mathematics; Mathematical problem; Computer science; Field (mathematics); Theoretical computer science; Biology; Pure mathematics; Bioinformatics; Mathematics education","authors":[{"name":"Lila Kari","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04818565574785137,"gpt":0.2615253658217996,"spread":0.2133397100739483,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004781926,0.0007241109,0.001282253,0.002826919,0.002175545,0.007282067,0.001265065,0.003695317,0.009396109],"category_scores_gemma":[0.01650549,0.0007124765,0.0009033013,0.002624893,0.01189762,0.01777566,0.003239425,0.01291736,0.005013316],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003711055,"about_ca_system_score_gemma":0.002088949,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002161137,"about_ca_topic_score_gemma":0.00154048,"domain_scores_codex":[0.9966995,0.001320004,0.0001672168,0.0005364771,0.001094485,0.0001822212],"domain_scores_gemma":[0.985989,0.008722533,0.0003274112,0.00194831,0.002199126,0.0008135044],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000368207,0.00001208623,0.0002088176,0.0002839445,0.00001305564,0.00008537358,0.0006263976,0.0007296612,0.0003748597,0.9078548,0.04909497,0.04067924],"study_design_scores_gemma":[0.00001020457,0.00001738481,0.0001467741,0.0002437445,0.000005835678,0.0001713345,0.0001754153,0.001496721,0.0003052007,0.6993248,0.2980771,0.00002548861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"review","genre_gemma":"empirical","genre_scores_codex":[0.005721944,0.3303126,0.1897747,0.2784016,0.026213,0.00006295765,0.0008118976,0.0008470982,0.1678541],"genre_scores_gemma":[0.2720332,0.3176429,0.2124142,0.04385945,0.05300164,0.0003762405,0.001122776,0.001729789,0.09781974],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009396109,"threshold_uncertainty_score":0.03143311,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1562193608","doi":"10.3233/fun-2006-71405","title":"A Formal Language Analysis of DNA Hairpin Structures","year":2006,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Mary's University; Western University","funders":"","keywords":"Formal language; Computer science; Programming language; Computational biology; Biology","authors":[{"name":"Lila Kari","is_ca":true},{"name":"Elena Losseva","is_ca":true},{"name":"Stavros Konstantinidis","is_ca":true},{"name":"Petr Sosı́k","is_ca":false},{"name":"G. Thierrin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006143947400711379,"gpt":0.2426447297500487,"spread":0.2365007823493373,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001371516,0.0005149973,0.0004901413,0.001956253,0.001221833,0.002489157,0.001281667,0.0006562912,0.004302226],"category_scores_gemma":[0.005427391,0.0004213282,0.002072233,0.001609436,0.002895772,0.004724105,0.001666065,0.001758752,0.0005766944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001845317,"about_ca_system_score_gemma":0.001399671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001562062,"about_ca_topic_score_gemma":0.0009726153,"domain_scores_codex":[0.9981616,0.0004460579,0.0001425177,0.0004588793,0.0005519591,0.000238961],"domain_scores_gemma":[0.9956995,0.002816155,0.0003285527,0.0004075433,0.0006131278,0.0001350688],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005984749,0.00005880613,0.0005463327,0.0001889859,0.00002427681,0.0002143025,0.0006704387,0.01274035,0.00634775,0.9434101,0.001574293,0.03416456],"study_design_scores_gemma":[0.00002058332,0.00005506671,0.0002363968,0.00005665164,0.00003108715,0.0002778092,0.0002182116,0.06538416,0.005486469,0.9166525,0.01154861,0.00003246192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05098189,0.0009239321,0.9365433,0.001368303,0.0001008746,0.0001117009,0.0004895622,0.0006320042,0.008848432],"genre_scores_gemma":[0.6316996,0.0008173653,0.3581747,0.0004733998,0.0002709411,0.0002086708,0.001209856,0.000198975,0.006946505],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004302226,"threshold_uncertainty_score":0.01439238,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2110917769","doi":"10.1155/2013/634832","title":"HyDEn: A Hybrid Steganocryptographic Approach for Data Encryption Using Randomized Error-Correcting DNA Codes","year":2013,"lang":"en","type":"article","venue":"BioMed Research International","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"National Research Council Canada; Université de Moncton","funders":"National Research Council Canada","keywords":"ASCII; Encryption; Computer science; Hamming code; Error detection and correction; Hamming distance; Cryptography; Set (abstract data type); Code (set theory); Theoretical computer science; Algorithm; Steganography; Decoding methods; Artificial intelligence; Image (mathematics); Programming language; Block code; Computer network","authors":[{"name":"Dan Tulpan","is_ca":true},{"name":"Chaouki Regoui","is_ca":true},{"name":"Guillaume Durand","is_ca":true},{"name":"Luc Belliveau","is_ca":true},{"name":"Serge Léger","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1878390544108485,"gpt":0.4148317964148738,"spread":0.2269927420040252,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004655504,0.0004787087,0.0005212732,0.000560058,0.000284113,0.0005307093,0.000904137,0.0007186592,0.001833203],"category_scores_gemma":[0.0007092023,0.0002067666,0.0003886794,0.0002789432,0.0006583159,0.001068295,0.001134927,0.0007511596,0.0006763187],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003494404,"about_ca_system_score_gemma":0.0003234843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002044833,"about_ca_topic_score_gemma":0.000349645,"domain_scores_codex":[0.9993999,0.0001359021,0.00002474414,0.00009515571,0.0002850695,0.00005917166],"domain_scores_gemma":[0.9995528,0.0001423436,0.00005157616,0.000151594,0.00007006342,0.00003155958],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008182753,0.0002683869,0.0009797816,0.0006182729,0.0002382214,0.000556655,0.000233575,0.06053791,0.5165005,0.1042256,0.002846134,0.3121766],"study_design_scores_gemma":[0.0001123527,0.0007738781,0.0005008196,0.00005395812,0.00005888378,0.001844872,0.00007338948,0.3695985,0.5750758,0.01406269,0.03774147,0.000103432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03677277,0.0007458901,0.9564372,0.000169191,0.0001122877,0.0001544668,0.00008745402,0.001054912,0.004465837],"genre_scores_gemma":[0.3976779,0.0007011432,0.5883358,0.0002421058,0.00004408044,0.0001503949,0.0002387294,0.0001011747,0.0125086],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001833203,"threshold_uncertainty_score":0.006132662,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4220848411","doi":"10.1016/j.ins.2022.03.003","title":"Supervisory control of discrete event systems under asynchronous spiking neuron P systems","year":2022,"lang":"en","type":"article","venue":"Information Sciences","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Supervisor; Supervisory control; Asynchronous communication; Computer science; Construct (python library); Event (particle physics); Control system; Process (computing); SNP; Control (management); Control theory (sociology); Theoretical computer science; Control engineering; Distributed computing; Artificial intelligence; Single-nucleotide polymorphism; Engineering; Programming language","authors":[{"name":"Xiaoliang Chen","is_ca":true},{"name":"Hong Peng","is_ca":false},{"name":"Jun Wang","is_ca":false},{"name":"Fei Hao","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02367749502025764,"gpt":0.2537733227940611,"spread":0.2300958277738034,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007093973,0.0003918615,0.0005374569,0.0002663938,0.0004083184,0.001073385,0.0006730372,0.0003858176,0.00168533],"category_scores_gemma":[0.002045613,0.0001402304,0.0003160615,0.0001943321,0.0007073862,0.000482127,0.0007290352,0.0006244661,0.0001171273],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004975831,"about_ca_system_score_gemma":0.0007801924,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002449522,"about_ca_topic_score_gemma":0.002446826,"domain_scores_codex":[0.9995536,0.00008785549,0.00003134999,0.0001397984,0.0001091448,0.00007816966],"domain_scores_gemma":[0.9986552,0.0006343123,0.000251125,0.00008551159,0.0002705108,0.0001033647],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009645697,0.0002256847,0.002356336,0.0002554644,0.0001437947,0.000647912,0.0004787181,0.7996889,0.05346812,0.0766643,0.001344414,0.0637618],"study_design_scores_gemma":[0.00003313129,0.0001256962,0.0004807257,0.000005521066,0.00001246156,0.00002687789,0.00001722109,0.9875938,0.002631126,0.008838156,0.000227716,0.000007592429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3710001,0.0002090809,0.6183659,0.0004009797,0.0001810541,0.00006663575,0.0001205223,0.0007358569,0.008919788],"genre_scores_gemma":[0.9967278,0.00002570592,0.002540433,0.00001376869,0.00001120796,0.0000177614,0.00001091323,0.000005653264,0.000646773],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002449522,"threshold_uncertainty_score":0.005637944,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071364560","doi":"10.1080/08948550213852","title":"DNA Computing: Models and Implementations","year":2002,"lang":"en","type":"article","venue":"Comments® on Theoretical Biology","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Implementation; Computer science; Computational biology; Theoretical computer science; Computer architecture; Programming language; Biology","authors":[{"name":"Mark Daley","is_ca":true},{"name":"Lila Kari","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03897692259768443,"gpt":0.3085882406305894,"spread":0.2696113180329049,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008116799,0.0008886128,0.0007972471,0.001133742,0.0008291277,0.003498877,0.00228495,0.002572413,0.006792631],"category_scores_gemma":[0.00304492,0.0006285749,0.0006697675,0.001693214,0.003126092,0.005335193,0.001239823,0.002387989,0.002955284],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001758005,"about_ca_system_score_gemma":0.001305178,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002057218,"about_ca_topic_score_gemma":0.001309985,"domain_scores_codex":[0.9994548,0.0001890521,0.00002675372,0.00007399037,0.0002025947,0.00005285947],"domain_scores_gemma":[0.9993094,0.0003832664,0.00004474578,0.0001196585,0.00009849184,0.00004432716],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004145349,0.000007770528,0.00003915326,0.00007733797,0.000003699736,0.00001742815,0.00005712935,0.008841206,0.00007542995,0.9802232,0.002680961,0.007972638],"study_design_scores_gemma":[0.000006257162,0.00000733354,0.00002336879,0.00004879773,0.000002429009,0.00003133159,0.00002727137,0.019831,0.00009495261,0.9558198,0.02410191,0.00000561096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01437275,0.08746307,0.6138949,0.02083584,0.001361032,0.0002325539,0.0009333497,0.001000737,0.2599057],"genre_scores_gemma":[0.5388188,0.1466512,0.2212537,0.003107557,0.002284164,0.001586063,0.001268464,0.0004619971,0.08456815],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006792631,"threshold_uncertainty_score":0.02272362,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2057447340","doi":"10.1142/s0129054107005145","title":"INVOLUTIVELY BORDERED WORDS","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Prefix; Suffix; Alphabet; Mathematics; Combinatorics on words; Combinatorics; Watson; Word (group theory); Involution (esoterism); Discrete mathematics; Computer science; Biology; Linguistics; Natural language processing","authors":[{"name":"Lila Kari","is_ca":true},{"name":"Kalpana Mahalingam","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01718857657105889,"gpt":0.3233007750085465,"spread":0.3061121984374877,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004310475,0.0003646999,0.0004709317,0.00100343,0.001016321,0.001821459,0.0006728089,0.0006342065,0.004133279],"category_scores_gemma":[0.002396617,0.0002532037,0.0006790697,0.0007456974,0.002781358,0.003297968,0.001294851,0.0009617694,0.0007713057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000731357,"about_ca_system_score_gemma":0.0003671763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006587317,"about_ca_topic_score_gemma":0.0005107754,"domain_scores_codex":[0.9990519,0.0001335824,0.0001005606,0.0003298155,0.0002124238,0.0001717043],"domain_scores_gemma":[0.9984073,0.0005979789,0.0003580461,0.0002486395,0.0002640008,0.0001240799],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004564161,0.00001769956,0.0004650339,0.00004407183,0.000008798946,0.0002740466,0.0004513584,0.001648168,0.004136835,0.9837617,0.0003156081,0.008830954],"study_design_scores_gemma":[0.00001563209,0.00007537513,0.000461221,0.00002448029,0.00001667169,0.0004865658,0.0002948805,0.009382949,0.005252752,0.9690468,0.01491457,0.0000281678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6663595,0.001718001,0.271816,0.0005751912,0.0003231305,0.00007304831,0.0003882266,0.0004366638,0.0583103],"genre_scores_gemma":[0.9567713,0.0004399154,0.02668952,0.0002387059,0.0001882059,0.00006799836,0.0003011034,0.0001139089,0.01518927],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004133279,"threshold_uncertainty_score":0.0138272,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2156204758","doi":"10.1016/j.tcs.2004.09.038","title":"Aspects of shuffle and deletion on trajectories","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Grantová Agentura České Republiky; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Decidability; Word (group theory); Context (archaeology); Generalization; Variable (mathematics); Sequence (biology); Constraint (computer-aided design); Focus (optics); Catenation; Binary number; Computer science; Palindrome; Context-free language; Quotient; Integer (computer science); Morphism; Mathematics; Algorithm; Discrete mathematics; Arithmetic; Combinatorics; Artificial intelligence; Programming language; Rule-based machine translation","authors":[{"name":"Lila Kari","is_ca":true},{"name":"Petr Sosı́k","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007725269626223187,"gpt":0.2393898409633678,"spread":0.2316645713371446,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001215326,0.0005135611,0.0009798692,0.00149229,0.002300616,0.002864399,0.00184964,0.002110544,0.0077487],"category_scores_gemma":[0.01038856,0.000468318,0.0009535022,0.001969455,0.003751366,0.006325822,0.00259302,0.002202897,0.0005106722],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001459209,"about_ca_system_score_gemma":0.0010374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003663233,"about_ca_topic_score_gemma":0.001534802,"domain_scores_codex":[0.9992115,0.0002214876,0.00004182481,0.0001145834,0.000255596,0.0001549545],"domain_scores_gemma":[0.9944218,0.003444716,0.0004360515,0.0007457632,0.0004313824,0.0005203747],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003437207,0.00000913342,0.0001677817,0.00001385138,0.000003497516,0.00005378946,0.0001069333,0.008745191,0.0002713862,0.987608,0.000469247,0.002516688],"study_design_scores_gemma":[0.00001080097,0.00001056251,0.0001001337,0.00000696682,0.000003116046,0.00005905825,0.00005666684,0.03168657,0.0003286519,0.9666615,0.001068393,0.000007514346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4954807,0.001558335,0.4285737,0.004642328,0.0003251848,0.0001052089,0.0005431563,0.0005830618,0.06818824],"genre_scores_gemma":[0.9584026,0.0009632851,0.02277018,0.0002063127,0.0001780412,0.0000872231,0.0003042255,0.0002651974,0.01682294],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0077487,"threshold_uncertainty_score":0.02592194,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2132713666","doi":"10.1109/memb.2006.1578663","title":"The quest for error correction in biology","year":2006,"lang":"en","type":"article","venue":"IEEE Engineering in Medicine and Biology Magazine","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Howard Hughes Medical Institute","keywords":"Systems biology; Coding (social sciences); Computational biology; Computer science; Error detection and correction; Biology; Data science; Algorithm; Mathematics","authors":[{"name":"Manish K. Gupta","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01863428916936006,"gpt":0.2957271069855238,"spread":0.2770928178161638,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01578712,0.001167756,0.002255279,0.002673868,0.003645625,0.00643064,0.003536597,0.007444619,0.006169845],"category_scores_gemma":[0.06421354,0.000817306,0.001170077,0.001865469,0.02322312,0.02312697,0.005817811,0.01323501,0.003587035],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002524566,"about_ca_system_score_gemma":0.003322474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001213761,"about_ca_topic_score_gemma":0.0005771762,"domain_scores_codex":[0.987717,0.00458824,0.0006682181,0.001906538,0.004363802,0.0007562626],"domain_scores_gemma":[0.9243254,0.05366158,0.00194458,0.01060096,0.008322634,0.001144857],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004248117,0.00002350691,0.0002626732,0.0003457364,0.00003169814,0.0001151246,0.0004770939,0.002414367,0.0007622511,0.9476451,0.009060895,0.03881919],"study_design_scores_gemma":[0.00001463185,0.00003133897,0.00006261947,0.0001786672,0.000009859618,0.0001488333,0.00007895887,0.00283887,0.0008715591,0.9614185,0.03430536,0.00004084154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.013666,0.1024193,0.6044095,0.1859859,0.01899993,0.0001233995,0.0003865113,0.001755771,0.07225368],"genre_scores_gemma":[0.4530339,0.1051672,0.3110305,0.05072553,0.03294358,0.0006440407,0.0004624101,0.001438485,0.04455439],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01578712,"threshold_uncertainty_score":0.08349121,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1567910696","doi":"10.1007/3-540-44968-x_33","title":"Generating Necklaces and Strings with Forbidden Substrings","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Substring; Computer science; Algorithm; Artificial intelligence; Programming language; Data structure","authors":[{"name":"Frank Ruskey","is_ca":true},{"name":"Joe Sawada","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01017285368743673,"gpt":0.2192672726429337,"spread":0.2090944189554969,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008074528,0.0007738729,0.0007711073,0.001031258,0.0008504243,0.0009449953,0.001603074,0.001439016,0.008073187],"category_scores_gemma":[0.005612149,0.0007288978,0.001033717,0.001316012,0.001305028,0.002106011,0.002715062,0.001205187,0.001886377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005776717,"about_ca_system_score_gemma":0.0004086492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000447469,"about_ca_topic_score_gemma":0.0007365777,"domain_scores_codex":[0.9994209,0.0001069453,0.00004703188,0.0001322782,0.0002230046,0.0000698539],"domain_scores_gemma":[0.997622,0.00151283,0.000133058,0.000438138,0.0002142805,0.00007973192],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000643993,0.0002238614,0.001383415,0.0007352552,0.00006759614,0.001163706,0.001110312,0.07148772,0.05331092,0.4391449,0.01154244,0.4191858],"study_design_scores_gemma":[0.0001548158,0.0002290117,0.0004323051,0.0001221927,0.0001029646,0.0007793616,0.0002291471,0.3440258,0.08896682,0.5413541,0.02352588,0.00007753095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1033047,0.0002065651,0.8762584,0.0002152363,0.0001608636,0.0001756982,0.0002622358,0.001818804,0.01759747],"genre_scores_gemma":[0.3454816,0.0002717702,0.6234612,0.0001119309,0.00005198914,0.0002788531,0.001084953,0.001098972,0.02815877],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008073187,"threshold_uncertainty_score":0.02700746,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}