{"id":"W2042644003","doi":"10.1016/j.jcss.2011.10.014","title":"An improved approximation algorithm for the complementary maximal strip recovery problem","year":2011,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Substring; Mathematics; Approximation algorithm; Combinatorics; Sequence (biology); Set (abstract data type); Algorithm; Discrete mathematics; Computer science","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.001043694,0.00007735605,0.0001155377,0.00004713723,0.0001688229,0.00007876887,0.000282549,0.00002839309,0.000002027272],"category_scores_gemma":[0.000001475188,0.00004623172,0.00006058796,0.00005403391,0.0000731984,0.00002429284,0.00004154134,0.00003432208,1.985026e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008822438,"about_ca_system_score_gemma":0.00005026193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001115243,"about_ca_topic_score_gemma":0.000002482577,"domain_scores_codex":[0.9992675,0.000052581,0.0002740817,0.000136274,0.0001387847,0.0001307555],"domain_scores_gemma":[0.9994913,0.00001522193,0.0002343719,0.00009128384,0.000118618,0.00004920635],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001466384,0.0002075323,0.001833823,0.0001667145,0.0003161316,0.000004090762,0.001102996,0.0002683541,0.03049625,0.000336925,0.001353026,0.9637675],"study_design_scores_gemma":[0.004336455,0.02049051,0.01558486,0.0001840183,0.0002327747,0.001097113,0.007766258,0.924935,0.01604896,0.001157686,0.007480052,0.0006863446],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07683662,0.0005832814,0.9216018,0.00005319777,0.0004333441,0.0003391468,0.00001142961,0.000003685148,0.000137442],"genre_scores_gemma":[0.6058625,0.000046924,0.3933572,0.00005785074,0.0006386393,0.000009197394,0.000006210503,0.0000060105,0.00001546118],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9630812,"threshold_uncertainty_score":0.1885275,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02802862343456994,"score_gpt":0.2509593860618263,"score_spread":0.2229307626272564,"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."}}