{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008631048,0.001273888,0.001332375,0.001522726,0.0008491239,0.001794236,0.001976416,0.001231928,0.01484182],"category_scores_gemma":[0.007689707,0.001148219,0.001257865,0.002062638,0.0009197403,0.003304001,0.00282197,0.003036201,0.002158064],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001057355,"about_ca_system_score_gemma":0.0007855424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001736806,"about_ca_topic_score_gemma":0.002651275,"domain_scores_codex":[0.9994969,0.0001246636,0.00002201654,0.0001314675,0.0001402117,0.00008466212],"domain_scores_gemma":[0.9979849,0.00123179,0.0001971189,0.0002704868,0.0001763238,0.0001394072],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005143707,0.0002179882,0.0007429649,0.0004494301,0.00009326535,0.0001864468,0.0005557814,0.3100951,0.007812405,0.3711043,0.03500821,0.2732196],"study_design_scores_gemma":[0.00006770624,0.00003982257,0.000182902,0.00003937567,0.00002078556,0.0000821093,0.0001429704,0.3782583,0.001139642,0.6137272,0.006282971,0.00001626103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03764629,0.0006866903,0.9437317,0.000589783,0.0001505348,0.0001218357,0.0004602456,0.0007188389,0.01589412],"genre_scores_gemma":[0.2061884,0.001088442,0.7712781,0.0003269703,0.0001609328,0.0003770022,0.00157246,0.000833281,0.01817432],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01484182,"threshold_uncertainty_score":0.04965085,"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."}}