{"id":"W2888977297","doi":"10.1007/s10878-018-0346-y","title":"An approximation algorithm for genome sorting by reversals to recover all adjacencies","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"Natural Science Foundation of Shandong Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Georgia Southern University; Office of the Vice President for Research and Economic Development, University at Buffalo; National Science Foundation","keywords":"Genome; Sorting; Approximation algorithm; Biology; Genomics; Gene; Computational biology; Mathematics; Algorithm; Computer science; Genetics","routes":{"ca_aff":true,"ca_fund":true,"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.0006393036,0.0001214808,0.0001735491,0.00008739629,0.00008110592,0.00006463183,0.0001975549,0.0001217734,0.00002012523],"category_scores_gemma":[0.000162804,0.0001206396,0.00007873838,0.0001138565,0.00002385546,0.00003671575,0.00003015755,0.00005229376,0.000002477767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005637298,"about_ca_system_score_gemma":0.00006545308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001984756,"about_ca_topic_score_gemma":2.775695e-7,"domain_scores_codex":[0.9989386,0.00006204771,0.0004230725,0.0001739342,0.0002160493,0.0001863384],"domain_scores_gemma":[0.9984623,0.00001077988,0.0004314407,0.0001592901,0.0008174365,0.0001187526],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0005394031,0.0004373835,0.0001208212,0.00003255417,0.0002793747,0.00000123993,0.0006632704,0.04091217,0.9182376,0.000131262,0.01336256,0.02528232],"study_design_scores_gemma":[0.01397783,0.02535203,0.0003586491,0.0001119557,0.0004596783,0.00006837631,0.000642913,0.1986253,0.5371566,0.00299925,0.2185823,0.001665181],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04165635,0.000119731,0.9558573,0.0001595036,0.001677368,0.0004025096,0.00002048454,0.000007850932,0.0000988679],"genre_scores_gemma":[0.1275833,0.0001515368,0.867142,0.0003428686,0.00408482,0.0000237875,0.0004053971,0.00006501001,0.0002013066],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.381081,"threshold_uncertainty_score":0.491954,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01089987414633301,"score_gpt":0.2672347587110028,"score_spread":0.2563348845646697,"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."}}