{"id":"W2014859375","doi":"10.1023/b:joco.0000031419.12290.2b","title":"A Further Improved Approximation Algorithm for Breakpoint Graph Decomposition","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":24,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Sorting; Combinatorics; Approximation algorithm; Theory of computation; Mathematics; Graph; Decomposition; Discrete mathematics; Breakpoint; Computer science; Algorithm","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.0008835286,0.002058476,0.001870903,0.001812038,0.0009341363,0.002277888,0.003533862,0.002099926,0.02465849],"category_scores_gemma":[0.004512328,0.0008363576,0.001900876,0.002967595,0.0007975712,0.004084563,0.002987926,0.004214315,0.005721136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001761664,"about_ca_system_score_gemma":0.002290633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00562571,"about_ca_topic_score_gemma":0.009707372,"domain_scores_codex":[0.9986626,0.0002321796,0.00006234058,0.0003825053,0.0004211018,0.000239273],"domain_scores_gemma":[0.998147,0.0005411524,0.00009692341,0.0007265469,0.0003148064,0.0001734748],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001079046,0.0008381252,0.001054949,0.0003829006,0.0001590361,0.0002093941,0.0002328065,0.1664081,0.02272631,0.03968082,0.04315171,0.7240767],"study_design_scores_gemma":[0.000357334,0.0001788483,0.0004594168,0.00003036748,0.00008894288,0.0002219999,0.00009020475,0.9271454,0.00706636,0.04734907,0.01697514,0.00003690124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01519626,0.0002314358,0.9728041,0.000603736,0.0002611783,0.0002583187,0.0005154668,0.003786531,0.006342985],"genre_scores_gemma":[0.05959817,0.0001114094,0.9305581,0.0002965373,0.00009142265,0.0002586143,0.001549512,0.0005694881,0.006966836],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02465849,"threshold_uncertainty_score":0.08249092,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005139858459938569,"score_gpt":0.2396506692138155,"score_spread":0.234510810753877,"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."}}