{"id":"W1566359724","doi":"10.1007/978-3-540-87361-7_3","title":"Decompositions of Multiple Breakpoint Graphs and Rapid Exact Solutions to the Median Problem","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":38,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Breakpoint; Computer science; Speedup; Combinatorics; Vertex (graph theory); Matching (statistics); Genome; Class (philosophy); Graph; Algorithm; Theoretical computer science; Mathematics; Biology; Parallel computing; Artificial intelligence; Genetics","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.0002590895,0.0002100141,0.0001888802,0.0002192289,0.0002057386,0.00003271999,0.0005111865,0.0001411504,0.000008034641],"category_scores_gemma":[0.00003017842,0.0001628291,0.00007780646,0.0001590666,0.000476694,0.000005040284,0.0004702457,0.0001754104,0.000003928166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003281332,"about_ca_system_score_gemma":0.0001366776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003362332,"about_ca_topic_score_gemma":0.0004097485,"domain_scores_codex":[0.9986855,0.00002003927,0.0002289289,0.0005304183,0.0002477887,0.0002872923],"domain_scores_gemma":[0.9991297,0.00005880063,0.00009535186,0.0004949385,0.0001217429,0.0000995047],"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.00004891939,0.0001610278,0.000619191,0.0001145049,0.0001766959,0.00002703746,0.002710402,0.03153994,0.1513265,0.0007013627,0.001261627,0.8113127],"study_design_scores_gemma":[0.008738092,0.01161919,0.02765519,0.003272162,0.0005265855,0.003268206,0.00002174385,0.1552,0.3515679,0.1971219,0.2304697,0.01053938],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005232162,0.002291705,0.9866392,0.00340471,0.000389963,0.0009640007,0.00007192211,0.00001917661,0.0009871569],"genre_scores_gemma":[0.822578,0.001044964,0.1751253,0.0006645126,0.0002755671,0.00003361435,0.00007095806,0.00003696417,0.0001701688],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8173458,"threshold_uncertainty_score":0.6639978,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01295613860787456,"score_gpt":0.2234872268379559,"score_spread":0.2105310882300814,"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."}}