{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001225926,0.001281645,0.001932508,0.001360303,0.00111367,0.002171248,0.003768438,0.002133722,0.01254216],"category_scores_gemma":[0.004848331,0.0007118644,0.001324696,0.002568237,0.0009320594,0.003451279,0.003062533,0.003000934,0.002169011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001382577,"about_ca_system_score_gemma":0.002825341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004699418,"about_ca_topic_score_gemma":0.00591704,"domain_scores_codex":[0.9987769,0.0002576843,0.00006330045,0.0002949852,0.0003519087,0.0002551431],"domain_scores_gemma":[0.9975812,0.001254044,0.0001410901,0.0005848071,0.0002830155,0.0001558399],"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.00145704,0.0008154706,0.001289861,0.0004891905,0.0001504677,0.0002788032,0.0003375926,0.3160337,0.01455747,0.06629533,0.03249973,0.5657952],"study_design_scores_gemma":[0.0002378862,0.0001050454,0.0002540765,0.00001943207,0.00004182101,0.0001352047,0.0001009123,0.9558303,0.002516096,0.03717674,0.003559941,0.00002247724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03203152,0.0002829696,0.9578514,0.0005941138,0.000138953,0.0002105432,0.0003511451,0.001952755,0.006586613],"genre_scores_gemma":[0.1368737,0.0001788519,0.8560273,0.0002277277,0.00009622094,0.0002913826,0.001209155,0.0003339764,0.004761706],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01254216,"threshold_uncertainty_score":0.04195768,"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."}}