{"id":"W1547622250","doi":"10.1007/3-540-45123-4_20","title":"Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":79,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Genome; Sorting; Heuristic; Computer science; Time complexity; Algorithm; Gene rearrangement; Gene; Computational biology; Genetics; Biology; Artificial intelligence","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008161678,0.0005073848,0.000843285,0.0009514581,0.0004653058,0.001126712,0.001290666,0.0006810676,0.006026354],"category_scores_gemma":[0.002132954,0.00061419,0.001277387,0.001569625,0.001174454,0.001625464,0.0008923911,0.001075893,0.002335749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003714816,"about_ca_system_score_gemma":0.0003790905,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005213942,"about_ca_topic_score_gemma":0.0009671812,"domain_scores_codex":[0.9995005,0.00009045006,0.00003419249,0.0002215119,0.000100443,0.00005284999],"domain_scores_gemma":[0.9990854,0.0004991312,0.0001217247,0.0002051832,0.0000528156,0.00003583412],"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.001008533,0.0001438689,0.005398162,0.0008911125,0.0001537261,0.0007178423,0.0004855154,0.07994037,0.1855119,0.1567527,0.00750978,0.5614865],"study_design_scores_gemma":[0.0002936253,0.0006870913,0.006369035,0.00016192,0.0003897896,0.004027639,0.0005121235,0.3912979,0.1883744,0.3397992,0.06792962,0.0001576445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1277527,0.001214153,0.8533911,0.0002790089,0.0002701724,0.0002046343,0.000613177,0.002528628,0.01374651],"genre_scores_gemma":[0.4053504,0.001658309,0.5732431,0.0001775615,0.0001119908,0.0001764302,0.002428442,0.001042598,0.01581115],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006026354,"threshold_uncertainty_score":0.0201602,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008509472042093532,"score_gpt":0.221017514445064,"score_spread":0.2125080424029705,"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."}}