{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00175519,0.0007098399,0.001245225,0.001080021,0.0006899662,0.0008888291,0.001134743,0.001268523,0.002248283],"category_scores_gemma":[0.005428392,0.0004795897,0.000548934,0.002362047,0.000968368,0.0009075172,0.0009726773,0.000907174,0.0003309721],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001054629,"about_ca_system_score_gemma":0.001479023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004888972,"about_ca_topic_score_gemma":0.004070379,"domain_scores_codex":[0.9989296,0.000719833,0.00003410309,0.0001117928,0.0001177724,0.00008694406],"domain_scores_gemma":[0.9974871,0.002091748,0.0001425902,0.0001020015,0.0001124823,0.00006410955],"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.0001052862,0.0001105936,0.0002951438,0.0001233746,0.00003973649,0.00007287383,0.00004725982,0.8916191,0.0007050041,0.04660679,0.002298207,0.05797666],"study_design_scores_gemma":[0.00003646367,0.00003446544,0.00005356236,0.000009408787,0.000008125143,0.00002909922,0.00001618539,0.9659348,0.000313531,0.03244242,0.00111584,0.000006121218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0196547,0.001231298,0.9723808,0.0004443147,0.00005684213,0.0001133605,0.00007916564,0.000417767,0.00562171],"genre_scores_gemma":[0.3533515,0.00100721,0.6416661,0.0003321252,0.00008660967,0.0003582211,0.0002156832,0.0001324424,0.002850049],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004888972,"threshold_uncertainty_score":0.009721041,"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."}}