{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002455346,0.0002484656,0.0002625708,0.0001897455,0.00008324164,0.0000400818,0.0003979525,0.0002022132,0.00006128867],"category_scores_gemma":[0.00001508413,0.0002483982,0.00006123223,0.00009941789,0.0004412643,0.000006815483,0.0002514194,0.0001554221,0.000007210706],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004735789,"about_ca_system_score_gemma":0.00009632368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001827916,"about_ca_topic_score_gemma":0.00001868663,"domain_scores_codex":[0.9984534,0.00001825812,0.0003012299,0.0006544178,0.0003079959,0.0002646515],"domain_scores_gemma":[0.9991936,0.00001527413,0.0001355532,0.0004760781,0.00009694956,0.00008250863],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004802117,0.0001090346,0.0003512382,0.0001014971,0.0001356623,0.00001378014,0.0003464279,0.002645162,0.7556716,0.00007309538,0.0002484827,0.240256],"study_design_scores_gemma":[0.009605277,0.007293486,0.01165067,0.002111816,0.0005338963,0.0003469124,0.000008449167,0.00870876,0.3503402,0.0472772,0.5542598,0.007863596],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09332209,0.01197719,0.8840691,0.0006519218,0.0006323291,0.001619404,0.0002758975,0.00003830366,0.007413767],"genre_scores_gemma":[0.8967459,0.007816749,0.08694439,0.001539632,0.0006348061,0.00004919004,0.0005893912,0.0001291042,0.005550876],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8034238,"threshold_uncertainty_score":0.9999968,"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."}}