{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002949107,0.001095272,0.001303462,0.001145224,0.0009055858,0.001721416,0.004200686,0.002076741,0.004673067],"category_scores_gemma":[0.02222472,0.0007999833,0.001729366,0.002098175,0.001687114,0.005155816,0.002365332,0.002188852,0.0005525669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002876536,"about_ca_system_score_gemma":0.002146909,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008793586,"about_ca_topic_score_gemma":0.009922403,"domain_scores_codex":[0.9971455,0.0007656392,0.000152485,0.001020566,0.0005189949,0.0003968525],"domain_scores_gemma":[0.9820294,0.0123702,0.00176008,0.002212563,0.001163592,0.0004640882],"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.0007346104,0.0002694112,0.006202093,0.0004841602,0.000127853,0.000292533,0.0005025981,0.8054592,0.007949971,0.03804979,0.005183961,0.1347438],"study_design_scores_gemma":[0.0000490366,0.00006903106,0.0006183683,0.0000195282,0.00003874449,0.0001691231,0.0001264024,0.9470967,0.003870045,0.04705356,0.0008756497,0.00001376553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2818072,0.0004978069,0.7104416,0.001583229,0.0000871162,0.0001998751,0.0006762001,0.001567945,0.003139065],"genre_scores_gemma":[0.5369205,0.0001745066,0.4570745,0.0002946078,0.00006893063,0.0001317384,0.001429718,0.0003762622,0.003529314],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008793586,"threshold_uncertainty_score":0.0208708,"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."}}