{"id":"W2051186751","doi":"10.1142/s0219720003000083","title":"Computational Assignment of Protein Backbone NMR Peaks by Efficient Bounding and Filtering","year":2003,"lang":"en","type":"article","venue":"Journal of Bioinformatics and Computational Biology","topic":"Protein Structure and Dynamics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Bounding overwatch; Computer science; Algorithm; Assignment problem; Bipartite graph; Computation; Greedy algorithm; Weapon target assignment problem; Process (computing); Matching (statistics); Computational complexity theory; Approximation algorithm; Generalized assignment problem; Mathematical optimization; Theoretical computer science; Mathematics; Optimization problem; Artificial intelligence; Graph","routes":{"ca_aff":true,"ca_fund":false,"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.0002761004,0.0001006334,0.0001765618,0.000065718,0.00006261484,0.00001992572,0.00005999011,0.0000820506,0.000004514296],"category_scores_gemma":[0.00005220617,0.00008258806,0.00004285628,0.00004260682,0.0001196099,0.000006951013,0.00004494493,0.00007635961,2.414864e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001401612,"about_ca_system_score_gemma":0.00007586616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001254722,"about_ca_topic_score_gemma":2.585788e-7,"domain_scores_codex":[0.999195,0.00003956947,0.0004615788,0.00007768333,0.0001154261,0.0001107151],"domain_scores_gemma":[0.9993266,0.00003316202,0.0003889961,0.00004639662,0.0001403717,0.00006442768],"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.0006751852,0.0005034182,0.00853028,0.0007873408,0.001095615,0.00001054032,0.001378295,0.3620501,0.4608467,0.1202905,0.001174107,0.04265806],"study_design_scores_gemma":[0.01364427,0.009953774,0.009360766,0.000552776,0.0002261372,0.003686191,0.002453521,0.7365492,0.07407166,0.117802,0.02974949,0.001950253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6801549,0.000774609,0.318654,0.0000602465,0.00004650054,0.00008858989,0.00002837471,0.000001202769,0.0001915397],"genre_scores_gemma":[0.9277035,0.00003889748,0.07208425,0.00008384838,0.00002356465,0.000001446046,0.00005088907,0.000004422722,0.000009209781],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.386775,"threshold_uncertainty_score":0.3367843,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.004713577335423098,"score_gpt":0.2258257784558294,"score_spread":0.2211122011204063,"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."}}