{"id":"W2592818772","doi":"10.1186/s13015-017-0096-x","title":"Approximating the correction of weighted and unweighted orthology and paralogy relations","year":2017,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal; University of Ottawa","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Maximization; Mathematics; Conjecture; Converse; Approximation algorithm; Graph; Tree (set theory); Satisfiability; Discrete mathematics; 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.0003306063,0.0001664943,0.0002301178,0.00005679877,0.0004087645,0.00002462809,0.0002210844,0.0002468972,0.000004535048],"category_scores_gemma":[0.0002057153,0.0001307682,0.0000708978,0.00003925788,0.0005889432,0.000005884754,0.0002193204,0.00009648102,0.000001021756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005703349,"about_ca_system_score_gemma":0.00002994715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005329914,"about_ca_topic_score_gemma":0.00002991662,"domain_scores_codex":[0.9989201,0.0001024845,0.0002753554,0.0003987351,0.00004743746,0.0002558975],"domain_scores_gemma":[0.9989766,0.00005249811,0.0003007819,0.0004994413,0.0001205137,0.00005010096],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000110038,0.00006924754,0.02644522,0.00004095523,0.0004266329,0.000004025788,0.000176753,0.0000150249,0.8667229,0.006317934,0.0002316578,0.09943962],"study_design_scores_gemma":[0.0128297,0.007296402,0.164276,0.00009522825,0.001074231,0.0008905199,0.0009537284,0.07104128,0.6142832,0.05010775,0.07474507,0.002406894],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8588789,0.001612703,0.13719,0.0006928088,0.0004239015,0.0006602527,0.00004077041,0.00001303736,0.0004876585],"genre_scores_gemma":[0.977585,0.0002202597,0.02143932,0.00009691463,0.0001050309,0.0001125169,0.000198093,0.00002650038,0.0002163595],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2524397,"threshold_uncertainty_score":0.533257,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01396313623744828,"score_gpt":0.2910071363754212,"score_spread":0.2770440001379729,"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."}}