{"id":"W2075485134","doi":"10.1007/s10878-010-9366-y","title":"Exact and approximation algorithms for the complementary maximal strip recovery problem","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":17,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Substring; Approximation algorithm; Combinatorics; Mathematics; Theory of computation; Algorithm; Sequence (biology); Set (abstract data type); Constant (computer programming); Running time; 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.0006053758,0.0001013751,0.0001246925,0.00005212122,0.00011676,0.00006698845,0.0001446023,0.00008943036,0.00001651669],"category_scores_gemma":[0.00008229517,0.00007693154,0.00007358737,0.00006387335,0.00003861131,0.00002265865,0.00004280888,0.0001254864,2.444475e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001415788,"about_ca_system_score_gemma":0.00006210518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003166456,"about_ca_topic_score_gemma":9.017182e-7,"domain_scores_codex":[0.9992357,0.00003594947,0.0003165726,0.0001148724,0.0001734501,0.0001234537],"domain_scores_gemma":[0.9991395,0.00004176447,0.0003398813,0.0001218466,0.000307722,0.00004929351],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.004463753,0.001648721,0.003482404,0.0003539813,0.002002615,0.000008160669,0.0006933959,0.2201465,0.5423642,0.007985799,0.02157042,0.1952801],"study_design_scores_gemma":[0.05352798,0.01780558,0.006210411,0.0001632787,0.001600029,0.0006922011,0.001381446,0.4993156,0.1301,0.04559515,0.2412765,0.002331866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08932164,0.0004912101,0.90213,0.001168209,0.005385726,0.001235632,0.00003508827,0.000009281092,0.0002232245],"genre_scores_gemma":[0.4381807,0.0008004349,0.5566226,0.0001338907,0.003751811,0.00004854699,0.0002916394,0.00005879831,0.0001116337],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4122642,"threshold_uncertainty_score":0.3137178,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01119861558667182,"score_gpt":0.247467282165162,"score_spread":0.2362686665784902,"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."}}