{"id":"W2041368329","doi":"10.1142/s0219720005001570","title":"HEURISTIC SEARCH IN CONSTRAINED BIPARTITE MATCHING WITH APPLICATIONS TO PROTEIN NMR BACKBONE RESONANCE ASSIGNMENT","year":2005,"lang":"en","type":"article","venue":"Journal of Bioinformatics and Computational Biology","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Combinatorics; Matching (statistics); Heuristics; Assignment problem; Complete bipartite graph; Mathematics; Heuristic; Combinatorial optimization; Local search (optimization); Algorithm; Computer science; Graph; Mathematical optimization","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.0004770059,0.00008293661,0.0001627228,0.0001984867,0.00007298822,0.00006859367,0.0002123497,0.00003009276,0.00000386006],"category_scores_gemma":[0.00001447465,0.00006060556,0.00002021147,0.0002374345,0.00004980965,0.0001701547,0.00006830518,0.0001902869,0.00001010919],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003167048,"about_ca_system_score_gemma":0.0001145916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005374013,"about_ca_topic_score_gemma":0.000003023572,"domain_scores_codex":[0.9990999,0.00004680436,0.0004369268,0.00008945282,0.0001712128,0.0001556983],"domain_scores_gemma":[0.9994017,0.0001181369,0.0001859215,0.00007718604,0.0001191714,0.00009789057],"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.00004455504,0.0001300491,0.001384875,0.00004587736,0.00002835062,0.000009189358,0.001866404,0.3407089,0.0002156373,0.1101073,0.00005877638,0.5454],"study_design_scores_gemma":[0.0009295224,0.0006387443,0.005407837,0.000114707,0.000003421614,0.0002722947,0.0001189078,0.9774953,0.00005139598,0.008719418,0.006084928,0.0001635218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0583776,0.0001056349,0.9375433,0.003592699,0.00001494276,0.0001633692,0.000003963087,0.000009141371,0.0001893376],"genre_scores_gemma":[0.5211521,0.000005511054,0.4784979,0.0002757164,0.00004114536,0.000006593748,0.000002230262,0.000001969404,0.00001687916],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6367863,"threshold_uncertainty_score":0.2471423,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01064784195063227,"score_gpt":0.2710084611486648,"score_spread":0.2603606191980325,"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."}}