{"id":"W2111945870","doi":"10.1016/j.tcs.2014.07.011","title":"On the approximability of the exemplar adjacency number problem for genomes with gene repetitions","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Alberta Innovates - Technology Futures; National Science Foundation","keywords":"Combinatorics; Parameterized complexity; Adjacency list; Mathematics; Genome; Approximation algorithm; Set (abstract data type); Alphabet; Measure (data warehouse); Discrete mathematics; Gene; Computer science; Biology; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003885954,0.001837094,0.00270085,0.001852134,0.001907569,0.004370769,0.005900694,0.004332919,0.01101125],"category_scores_gemma":[0.04003956,0.00109632,0.002325687,0.00256036,0.003882608,0.01002224,0.004081713,0.005919517,0.001135716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003093062,"about_ca_system_score_gemma":0.002163933,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006213332,"about_ca_topic_score_gemma":0.006566249,"domain_scores_codex":[0.99721,0.001121727,0.0001293682,0.000701217,0.0004657398,0.0003719869],"domain_scores_gemma":[0.9561831,0.03926821,0.001014198,0.001959044,0.0008532418,0.0007220859],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001087177,0.0004830708,0.003473492,0.000671283,0.0001884941,0.0002356719,0.0007746795,0.6392479,0.002511691,0.2746493,0.01232221,0.06435499],"study_design_scores_gemma":[0.00007194412,0.00004936458,0.0002708875,0.00003816943,0.00003516852,0.0001018549,0.00009796742,0.6882381,0.0005368585,0.3096077,0.0009353044,0.00001665772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2610508,0.001713734,0.7066873,0.005589436,0.0002576264,0.0001584811,0.000839119,0.001967966,0.02173552],"genre_scores_gemma":[0.6797733,0.0009920762,0.3050296,0.0009503437,0.0004729225,0.0003024027,0.002263524,0.0009134181,0.009302357],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01101125,"threshold_uncertainty_score":0.03683627,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006080399229874966,"score_gpt":0.2175287279566609,"score_spread":0.211448328726786,"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."}}