{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007693641,0.0005941282,0.0006494555,0.001027887,0.0003664498,0.0008292936,0.0009480409,0.0007971871,0.001553828],"category_scores_gemma":[0.003982639,0.0002644604,0.0003223317,0.0006173901,0.0008105576,0.00152086,0.000971156,0.0008120841,0.0003014584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009562374,"about_ca_system_score_gemma":0.0009215648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002323644,"about_ca_topic_score_gemma":0.002330891,"domain_scores_codex":[0.9997362,0.00005451969,0.00001491518,0.00002841384,0.0001337409,0.0000321788],"domain_scores_gemma":[0.998884,0.0007162159,0.00009672875,0.000126926,0.0001191603,0.00005700056],"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.0002865399,0.00009555389,0.002507035,0.0001465064,0.00004462847,0.0001458502,0.00007484976,0.8701029,0.01068487,0.0187139,0.002537091,0.09466028],"study_design_scores_gemma":[0.000006378211,0.000019692,0.0001716733,0.000002575605,0.000001671683,0.00001376214,0.00000430604,0.9937529,0.002137741,0.003711609,0.000173361,0.000004452183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1753503,0.0006630565,0.8171696,0.0003414791,0.00006581721,0.0001141817,0.0004330654,0.003401071,0.00246131],"genre_scores_gemma":[0.7752631,0.0002959952,0.2218721,0.0001405446,0.00004577651,0.0001835461,0.0006079728,0.0002670255,0.001323975],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002323644,"threshold_uncertainty_score":0.00693804,"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."}}