{"id":"W3013736025","doi":"10.4230/lipics.stacs.2020.15","title":"The Tandem Duplication Distance Is NP-Hard","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Gene duplication; Tandem exon duplication; Tandem; Edit distance; Computer science; Genome; Tandem repeat; String (physics); Sequence (biology); Mathematics; Biology; Algorithm; Combinatorics; Computational biology; Genetics; 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.0007571331,0.001524032,0.002373561,0.0007085898,0.001845348,0.004152569,0.003522811,0.003411739,0.01212266],"category_scores_gemma":[0.007389242,0.0008778162,0.001773847,0.002830154,0.00218527,0.00813706,0.002338955,0.005950951,0.002014711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003132519,"about_ca_system_score_gemma":0.002251759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00371417,"about_ca_topic_score_gemma":0.003823559,"domain_scores_codex":[0.9980446,0.0003174505,0.000104644,0.0008193276,0.0003645572,0.0003493637],"domain_scores_gemma":[0.9905256,0.007959656,0.0004226667,0.0004450871,0.0003420175,0.000305023],"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.001213875,0.001014127,0.004415891,0.003701785,0.0005151446,0.001259446,0.0008267159,0.3421506,0.009676353,0.2667635,0.1819477,0.1865149],"study_design_scores_gemma":[0.0002591584,0.0001587625,0.001473812,0.0001443305,0.0001429074,0.001119032,0.0006343493,0.2808414,0.004499864,0.6796955,0.03094521,0.00008565075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3619143,0.01150641,0.4045669,0.06619751,0.001833207,0.0007822662,0.02154078,0.00418299,0.1274756],"genre_scores_gemma":[0.787515,0.005827371,0.1470479,0.00628463,0.002247456,0.0006657298,0.01586525,0.001214743,0.03333195],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01212266,"threshold_uncertainty_score":0.04055434,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02139986769993045,"score_gpt":0.2490937005606947,"score_spread":0.2276938328607642,"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."}}