{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004624542,0.001351221,0.002973686,0.002179328,0.002208614,0.005932709,0.004666795,0.003082657,0.01450995],"category_scores_gemma":[0.05163339,0.0009136613,0.002003155,0.003959727,0.004974524,0.01357313,0.006086998,0.007201537,0.001130257],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002964483,"about_ca_system_score_gemma":0.002479576,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004248083,"about_ca_topic_score_gemma":0.003688738,"domain_scores_codex":[0.9951036,0.002289965,0.0002217626,0.0007528421,0.001097602,0.0005342514],"domain_scores_gemma":[0.9281779,0.06563224,0.001438018,0.00241312,0.001260194,0.001078677],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005996965,0.0003186534,0.002181071,0.000477077,0.000111687,0.0001524232,0.0004888101,0.2660704,0.0007516126,0.6630565,0.01289162,0.05290053],"study_design_scores_gemma":[0.00006706547,0.00002733079,0.0002588569,0.00002887615,0.00001915793,0.00005185869,0.00009952838,0.3144329,0.000222569,0.68325,0.00152714,0.0000146676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2000092,0.005405068,0.7151436,0.01888201,0.0007097754,0.0002151654,0.001337467,0.0007927252,0.05750514],"genre_scores_gemma":[0.7665933,0.003442408,0.2082496,0.001469063,0.001240878,0.0004127657,0.001893739,0.0006141206,0.01608392],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01450995,"threshold_uncertainty_score":0.04854059,"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."}}