{"id":"W4402586402","doi":"10.1007/978-3-031-72200-4_10","title":"Simultaneously Building and Reconciling a Synteny Tree","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Tree (set theory); Synteny; Theoretical computer science; Mathematics; Combinatorics","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":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007250054,0.0005150533,0.0004897328,0.0007038123,0.0002681222,0.00119402,0.002368114,0.0002868728,0.00001208811],"category_scores_gemma":[0.0001115565,0.0004333463,0.00009523598,0.000446183,0.000442768,0.0006973965,0.002953047,0.0009179829,0.00003756649],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001993425,"about_ca_system_score_gemma":0.0002847904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003040679,"about_ca_topic_score_gemma":0.00004846498,"domain_scores_codex":[0.9962178,0.00001640281,0.0004603601,0.00193202,0.0007845022,0.0005889005],"domain_scores_gemma":[0.9975784,0.0007504656,0.0001575969,0.001157281,0.0001479033,0.0002083125],"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.000002765153,0.000007211494,0.00000516912,0.0000576036,0.000009148722,0.0004300255,0.0003662952,0.00636945,0.0002760368,0.02318596,0.00001783676,0.9692725],"study_design_scores_gemma":[0.0001007062,0.0000917857,0.00000627851,0.0009509207,0.000008091059,0.0002971107,1.443577e-7,0.8125879,0.0003619894,0.1805948,0.004525531,0.0004747462],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001443161,0.002827048,0.9914393,0.0005482925,0.002050102,0.0002391711,0.000009730548,0.0002654059,0.002476563],"genre_scores_gemma":[0.06824328,0.000246367,0.9283243,0.001038631,0.0008591869,0.000007517678,0.000005096165,0.00006231003,0.001213343],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9687977,"threshold_uncertainty_score":0.9998428,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01481826947963107,"score_gpt":0.2471356584624695,"score_spread":0.2323173889828384,"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."}}