{"id":"W2294802772","doi":"10.1007/978-3-642-21204-8_9","title":"An Improved Approximation Algorithm for the Complementary Maximal Strip Recovery Problem","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Substring; Approximation algorithm; Combinatorics; Algorithm; STRIPS; Sequence (biology); Set (abstract data type); Mathematics; Computer science; Discrete mathematics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006400255,0.0003453334,0.0002306902,0.0001463892,0.000213586,0.000128781,0.001073283,0.0002287515,0.00002714741],"category_scores_gemma":[0.00001144478,0.000270443,0.000118162,0.00008814982,0.0003237812,0.00001941812,0.0003334517,0.0002294445,0.000003629808],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007577083,"about_ca_system_score_gemma":0.0002186887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003269689,"about_ca_topic_score_gemma":0.00007306455,"domain_scores_codex":[0.9980515,0.00002086033,0.0003253197,0.0009027386,0.0002720194,0.0004276054],"domain_scores_gemma":[0.9987189,0.00004787805,0.000212036,0.0007646446,0.0001800122,0.00007658399],"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.00002317828,0.00003358664,0.00000779846,0.00002554211,0.00003954651,0.000001150508,0.00008535293,0.0009647686,0.007778725,0.00007087206,0.0000364957,0.990933],"study_design_scores_gemma":[0.002112705,0.004415232,0.0002302024,0.0001561792,0.0001399479,0.00006245195,0.00000383758,0.833672,0.03911793,0.08928981,0.02896745,0.001832284],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00008735558,0.000475592,0.9968508,0.0001172668,0.00057003,0.001407328,0.00009764152,0.00001928854,0.0003747051],"genre_scores_gemma":[0.01026983,0.0001660299,0.9861081,0.0007627331,0.001406866,0.000126647,0.0006574119,0.00007777774,0.0004246476],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9891007,"threshold_uncertainty_score":0.9999748,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01830877909192158,"score_gpt":0.2418201984733534,"score_spread":0.2235114193814318,"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."}}