{"id":"W2941817316","doi":"10.1016/j.dam.2019.04.002","title":"On the computational complexity of closest genome problems","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Genome; Breakpoint; Pairwise comparison; Mathematics; Hamming distance; Combinatorics; Gene rearrangement; Edit distance; Computational biology; Algorithm; Biology; Genetics; Chromosome; Gene","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":[],"consensus_categories":[],"category_scores_codex":[0.0001778804,0.0001305745,0.0001580114,0.00002259175,0.00004091451,0.0000137964,0.0002436371,0.00005478032,0.0001432817],"category_scores_gemma":[0.00001146579,0.00009133745,0.00006626859,0.00006661882,0.0001253397,0.00000113134,0.0001009555,0.00006587002,0.0001367177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008146706,"about_ca_system_score_gemma":0.00002143535,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001117467,"about_ca_topic_score_gemma":0.000001059752,"domain_scores_codex":[0.9992098,0.00001152705,0.0002232608,0.000185585,0.0002183722,0.0001514898],"domain_scores_gemma":[0.9993534,0.00003826572,0.0001432484,0.0003918064,0.00004369818,0.00002957575],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002801104,0.0002278314,0.00007928515,0.0003052049,0.0001704531,2.606311e-7,0.0005475112,0.006888676,0.5230713,0.4682079,0.0003515937,0.0001219944],"study_design_scores_gemma":[0.004445265,0.001525279,0.007770903,0.000174458,0.0001892453,0.00002324104,0.002726505,0.02082491,0.122553,0.8263338,0.01165648,0.001776945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9532288,0.00004287114,0.01509668,0.0001711514,0.00003783653,0.0009401387,0.00006230712,0.00001300976,0.03040718],"genre_scores_gemma":[0.9859816,0.000007306513,0.01338855,0.0001080211,0.00003151854,0.0000357645,0.0002037274,0.00002357091,0.0002199075],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4005183,"threshold_uncertainty_score":0.3724633,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02168380689910793,"score_gpt":0.2354475112205545,"score_spread":0.2137637043214466,"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."}}