{"id":"W1996806342","doi":"10.1142/s0219720007003107","title":"COMPUTING THE BREAKPOINT DISTANCE BETWEEN PARTIALLY ORDERED GENOMES","year":2007,"lang":"en","type":"article","venue":"Journal of Bioinformatics and Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Tsinghua University; McMaster University; University of Minnesota; National Science Foundation","keywords":"Breakpoint; Genome; Nondeterministic algorithm; Chromosome; Computational biology; Heuristic; Biology; Algorithm; Genetics; Computer science; Gene; Artificial intelligence","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007079671,0.000487083,0.0008739933,0.002072795,0.0006946083,0.001183741,0.001606472,0.001220942,0.002218449],"category_scores_gemma":[0.008276398,0.0004576317,0.0007038325,0.001267927,0.0005143753,0.001961003,0.001131646,0.001003429,0.0003170321],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001163741,"about_ca_system_score_gemma":0.001009868,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003669457,"about_ca_topic_score_gemma":0.003266216,"domain_scores_codex":[0.9991842,0.0001475516,0.00006382397,0.000315138,0.0001993245,0.00009000124],"domain_scores_gemma":[0.9956484,0.003112219,0.0004075747,0.0003611187,0.000299072,0.0001714914],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009780694,0.0002072665,0.01712718,0.0004023442,0.0001542455,0.000403017,0.0003800852,0.7010577,0.02194603,0.02607282,0.002065364,0.2292059],"study_design_scores_gemma":[0.00005679223,0.00011706,0.00266757,0.00001861784,0.00002800429,0.0002121039,0.0001519965,0.9459847,0.009351668,0.04004478,0.001341126,0.00002558833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4525025,0.0003502045,0.5430467,0.0003045244,0.0000302664,0.00009619723,0.001159471,0.001379209,0.00113092],"genre_scores_gemma":[0.6678817,0.0001441941,0.3280809,0.00005074776,0.00001104385,0.00007790334,0.002884929,0.0001327983,0.000735753],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003669457,"threshold_uncertainty_score":0.008443534,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01005030312995211,"score_gpt":0.2603520993494437,"score_spread":0.2503017962194916,"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."}}