{"id":"W4400451024","doi":"10.1021/acs.jcim.4c00461","title":"DeltaGzip: Computing Biopolymer–Ligand Binding Affinity via Kolmogorov Complexity and Lossless Compression","year":2024,"lang":"en","type":"article","venue":"Journal of Chemical Information and Modeling","topic":"Computational Drug Discovery Methods","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; National Research Council Canada; Institut de Valorisation des Données","keywords":"Lossless compression; Biopolymer; Compression (physics); Ligand (biochemistry); Chemistry; Mathematics; Data compression; Computer science; Materials science; Algorithm; Organic chemistry; Biochemistry; Polymer; Composite material","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007814415,0.0001284879,0.0002202166,0.0002395495,0.0001147748,0.0005618469,0.0002228617,0.00006562168,0.00000215711],"category_scores_gemma":[0.00005600349,0.0001071479,0.0000650629,0.0002183356,0.00006152098,0.002550453,0.0002804713,0.0003166131,0.000002225264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004515464,"about_ca_system_score_gemma":0.00007707502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007785509,"about_ca_topic_score_gemma":1.397389e-7,"domain_scores_codex":[0.9986733,0.00004797221,0.0006682771,0.0001178467,0.0003368626,0.0001557979],"domain_scores_gemma":[0.9991257,0.0002574048,0.0002099067,0.00008540128,0.0001715904,0.0001500142],"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.0001077092,0.00009092121,0.0001269014,0.0007873877,0.0001420328,0.00002473789,0.007568,0.1940347,0.06802749,0.04612023,0.0003443508,0.6826255],"study_design_scores_gemma":[0.0002806557,0.00001993241,0.00001963043,0.0002502066,0.00001066949,0.0002855702,0.00009151463,0.978596,0.01454985,0.005646688,0.0001277637,0.0001215372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4574944,0.000358406,0.5415527,0.0002874212,0.0001736758,0.00002913667,0.000001810683,0.00002662833,0.00007575566],"genre_scores_gemma":[0.9269425,0.00004589375,0.07275297,0.0001628452,0.00008535506,3.028628e-7,0.000004903117,0.000004178795,0.000001109889],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7845613,"threshold_uncertainty_score":0.5417903,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04923626758751015,"score_gpt":0.3245894764046005,"score_spread":0.2753532088170904,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}