{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001373586,0.0006322691,0.000933711,0.0007630232,0.001002959,0.00198277,0.001185921,0.001337918,0.008105384],"category_scores_gemma":[0.00547802,0.0005238585,0.0009966794,0.001252272,0.001208937,0.005689246,0.001501499,0.001532916,0.002264675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005690837,"about_ca_system_score_gemma":0.001111117,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005333933,"about_ca_topic_score_gemma":0.001135146,"domain_scores_codex":[0.9988275,0.0002687534,0.0001095602,0.0003745889,0.0002533987,0.0001662577],"domain_scores_gemma":[0.9970315,0.001466855,0.0004161363,0.0007413474,0.000211259,0.0001330616],"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.0005441675,0.00023893,0.004221832,0.0004674717,0.0001402283,0.0003244774,0.00022379,0.1036833,0.03149708,0.3909828,0.01172914,0.4559468],"study_design_scores_gemma":[0.0001354172,0.0003120254,0.0008312785,0.0000453605,0.0000425396,0.0005742956,0.0002877702,0.1796962,0.01683436,0.7863017,0.01486233,0.0000766866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1301947,0.0004141186,0.8553886,0.001251789,0.0001820325,0.0001500821,0.0003197239,0.001827989,0.010271],"genre_scores_gemma":[0.503668,0.0004918116,0.4888937,0.0004686454,0.0001209218,0.0001070159,0.001127569,0.0003060054,0.004816436],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008105384,"threshold_uncertainty_score":0.02711523,"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."}}