{"id":"W2068896404","doi":"10.1109/tcbb.2007.1011","title":"Perfect Sorting by Reversals Is Not Always Difficult","year":2007,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Computational Biology and Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":57,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University; Université du Québec à Montréal","funders":"","keywords":"Sorting; Pairwise comparison; Simple (philosophy); Computation; Class (philosophy); Time complexity; Computer science; Combinatorics; Permutation (music); Mathematics; Algorithm; Discrete mathematics; Theoretical computer science; Artificial intelligence; Physics","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.0003209673,0.0001932571,0.0001574225,0.00009594992,0.0002628846,0.00002484303,0.0001528478,0.0002261247,0.00003510289],"category_scores_gemma":[0.0000283364,0.0001735307,0.00008141452,0.0001299638,0.0001382984,0.00001139016,0.00001110421,0.0001547371,0.00003790694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001910852,"about_ca_system_score_gemma":0.00003723266,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006369437,"about_ca_topic_score_gemma":0.000005730665,"domain_scores_codex":[0.9989361,0.00002794468,0.0003970185,0.0002281806,0.0001270158,0.0002837332],"domain_scores_gemma":[0.9993618,0.0001036488,0.0001277566,0.0001895638,0.0001202692,0.00009699486],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0009524017,0.0009939123,0.004952583,0.0003555685,0.001549302,0.000008446837,0.002914995,0.01286491,0.4591749,0.0003753095,0.01704467,0.498813],"study_design_scores_gemma":[0.009832058,0.005669083,0.01274497,0.0001517929,0.0004317039,0.0004428298,0.002834697,0.06167752,0.8020977,0.003706299,0.09695257,0.003458812],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3189594,0.0001241549,0.6793383,0.0005007189,0.0002491762,0.0002245709,0.0002295407,0.00003253334,0.0003416304],"genre_scores_gemma":[0.9555004,0.0001805643,0.04185525,0.001655579,0.00008965353,0.000009467003,0.0003942273,0.00001446926,0.0003004209],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.637483,"threshold_uncertainty_score":0.7076376,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01292711891529862,"score_gpt":0.2704998828774565,"score_spread":0.2575727639621578,"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."}}