{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009578521,0.0001002903,0.00009233764,0.00001254366,0.0002536752,0.00003023032,0.0006949551,0.00003275109,0.00002554791],"category_scores_gemma":[0.00008467056,0.00004853751,0.00006187077,0.0001886121,0.002165313,0.000003495983,0.0002370749,0.00006203934,0.000003481398],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001047698,"about_ca_system_score_gemma":0.00005546239,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.993157e-7,"about_ca_topic_score_gemma":6.459906e-7,"domain_scores_codex":[0.9989436,0.00008830669,0.0001311846,0.0003533964,0.0002495419,0.0002340078],"domain_scores_gemma":[0.9989321,0.00008733643,0.00005759814,0.0007183352,0.0001546587,0.00004998797],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003826149,0.00009546541,0.0005063132,0.00001714476,0.00001185437,6.36761e-8,0.00007800728,0.0001806275,0.04150756,0.9551978,0.00007814967,0.002288756],"study_design_scores_gemma":[0.001077725,0.002003811,0.005131266,0.0000641013,0.00005114256,0.00002889237,0.00003113667,0.01969921,0.5843682,0.3831472,0.00391967,0.0004776126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5397316,0.00001237026,0.4548051,0.001145279,0.00007567905,0.0006201798,0.00000995397,0.000008822029,0.003591018],"genre_scores_gemma":[0.9604384,0.000002557722,0.03916703,0.0002370124,0.00007401704,0.00004496963,0.00000288355,0.0000075751,0.00002550822],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5720505,"threshold_uncertainty_score":0.7978185,"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."}}