{"id":"W1999792620","doi":"10.1016/s0022-0000(02)00003-x","title":"Reconstructing an ancestral genome using minimum segments duplications and reversals","year":2002,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":37,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Gene duplication; Genome; Ancestor; Phylogenetic tree; Gene; Biology; Genome evolution; Substring; Genetics; Segmental duplication; Evolutionary biology; Gene family; Computational biology; Computer science; Data structure","routes":{"ca_aff":true,"ca_fund":false,"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.0003861145,0.00006233621,0.0001136646,0.0000608789,0.0001487984,0.00009165458,0.0001208864,0.00002869197,0.000002354268],"category_scores_gemma":[0.000003162332,0.00004990711,0.0000245304,0.00006776772,0.00009887543,0.00002459119,0.0000372217,0.00003188637,3.023424e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007793144,"about_ca_system_score_gemma":0.00001627122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002289051,"about_ca_topic_score_gemma":3.98956e-7,"domain_scores_codex":[0.9993696,0.0000447551,0.0002248451,0.0001390455,0.0001131841,0.000108547],"domain_scores_gemma":[0.9995989,0.000006737144,0.0001923227,0.00006518301,0.00005891333,0.00007800615],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002584718,0.0001547616,0.1850485,0.0002994221,0.000276673,0.0000389004,0.002444931,0.002874704,0.7541775,0.0002017349,0.0002961592,0.05416088],"study_design_scores_gemma":[0.00627573,0.008990629,0.120863,0.001176375,0.0003804766,0.03068231,0.015638,0.7938352,0.01335698,0.0002895449,0.006332752,0.002179089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9917207,0.00141553,0.006446409,0.00003949561,0.0001798933,0.00005197111,0.000001719963,0.00000198239,0.000142304],"genre_scores_gemma":[0.9556499,0.0001013397,0.04395919,0.00001813335,0.0002517888,3.152096e-7,3.58549e-7,0.000002599286,0.000016438],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7909604,"threshold_uncertainty_score":0.2035153,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05013380049442868,"score_gpt":0.2731117117269388,"score_spread":0.2229779112325101,"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."}}