{"id":"W2139251761","doi":"10.1186/1471-2105-13-s19-s8","title":"A consolidation algorithm for genomes fractionated after higher order polyploidization","year":2012,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Deutscher Akademischer Austauschdienst","keywords":"Genome; Algorithm; Gene duplication; Consolidation (business); Biology; Fractionation; Computer science; Computational biology; Gene; Genetics; Chemistry","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.0001662315,0.000147366,0.0001041036,0.00006991164,0.00007358682,0.00003705665,0.00008269647,0.0001564398,0.0001325546],"category_scores_gemma":[0.0000339255,0.0001399425,0.00006206874,0.0001279987,0.00003496257,0.00003380939,0.00004843625,0.00004198946,0.00008974608],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002734095,"about_ca_system_score_gemma":0.00005498781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001865988,"about_ca_topic_score_gemma":0.000001956658,"domain_scores_codex":[0.999172,0.00001746067,0.0002724797,0.0001055216,0.000133496,0.0002990566],"domain_scores_gemma":[0.9993671,0.00001448467,0.0001303567,0.0002096966,0.0001923971,0.00008600742],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0009155113,0.002123195,0.1230303,0.001906968,0.001909876,0.000001410417,0.004385336,0.002654112,0.08202413,0.001729571,0.06025903,0.7190606],"study_design_scores_gemma":[0.003196612,0.0003553331,0.0262761,0.00002346093,0.0001799412,0.0000239276,0.0005791609,0.1476295,0.02599921,0.0001186447,0.7945789,0.001039176],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01132233,0.00100394,0.9853321,0.00005120286,0.0005590394,0.0006337859,0.000105211,0.0000386153,0.0009537576],"genre_scores_gemma":[0.06505927,0.0001870164,0.928033,0.000554299,0.0009263175,0.0002961765,0.002280085,0.00005252208,0.002611334],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7343199,"threshold_uncertainty_score":0.5706691,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01557347247331774,"score_gpt":0.2546698865780523,"score_spread":0.2390964141047346,"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."}}