{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003261003,0.0001203132,0.0001590391,0.0001097895,0.00006207649,0.0000442356,0.0001195798,0.0001280917,0.000006307992],"category_scores_gemma":[0.0000433688,0.0001152843,0.0001563703,0.0001122394,0.00002168285,0.00002314517,0.00002050695,0.00006513204,7.931768e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006351234,"about_ca_system_score_gemma":0.0001059925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002855248,"about_ca_topic_score_gemma":2.535376e-7,"domain_scores_codex":[0.9991496,0.00003451471,0.0003791232,0.0001326693,0.0001643003,0.0001398105],"domain_scores_gemma":[0.9988474,0.00000774399,0.0004147785,0.0001164063,0.0005482338,0.00006548374],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001009528,0.001245189,0.00004726827,0.00007466883,0.0005383549,0.000004557702,0.0004441012,0.5145289,0.4395247,0.001610661,0.0004619188,0.04051014],"study_design_scores_gemma":[0.06374694,0.01446327,0.0003408737,0.0002322386,0.0006957418,0.0004095804,0.0004837854,0.2222212,0.6220192,0.06773689,0.006036867,0.001613393],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01443436,0.0001480617,0.9832287,0.0002347387,0.001507598,0.0003815266,0.000007335545,0.000007253661,0.0000503579],"genre_scores_gemma":[0.1981577,0.0001621324,0.7998018,0.00006835442,0.00149442,0.00002904349,0.0002190095,0.00004536086,0.0000221786],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2923077,"threshold_uncertainty_score":0.4701159,"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."}}