{"id":"W3028360845","doi":"10.1109/access.2020.2995812","title":"Construction of Duplication Correcting Codes","year":2020,"lang":"en","type":"article","venue":"IEEE Access","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Construct (python library); Palindrome; Extension (predicate logic); Tandem exon duplication; Gene duplication; Code (set theory); Computer science; Mathematics; Algorithm; Discrete mathematics; Combinatorics; Genetics; Biology; Genome; Programming language; Set (abstract data type)","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.0003266861,0.0005587877,0.0005106197,0.001008048,0.0009483887,0.001024328,0.0008098276,0.0007906193,0.003134059],"category_scores_gemma":[0.001522053,0.0003525458,0.0006817703,0.0009094258,0.001017016,0.0006635785,0.001808882,0.001267831,0.001153899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006943084,"about_ca_system_score_gemma":0.001137136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004446051,"about_ca_topic_score_gemma":0.0004831826,"domain_scores_codex":[0.9993636,0.00009136158,0.00005083641,0.0001119539,0.0002330082,0.000149235],"domain_scores_gemma":[0.9988437,0.0002149634,0.0001370181,0.0003609723,0.0002930117,0.0001502834],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002346388,0.0001481494,0.002148305,0.0004521001,0.00005359687,0.0007579184,0.0006674356,0.02618827,0.1208514,0.7404154,0.003855006,0.1042278],"study_design_scores_gemma":[0.0001285392,0.0008118204,0.002307507,0.0002334409,0.0001120873,0.002265602,0.0003186971,0.1023543,0.3892556,0.3795325,0.1223733,0.0003065253],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3099781,0.0008993634,0.645818,0.0005375614,0.0006437612,0.0002835025,0.0007247361,0.001936024,0.03917892],"genre_scores_gemma":[0.7041547,0.0008326667,0.2700159,0.0003254593,0.00008030363,0.0002332773,0.001099683,0.0003287077,0.02292918],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003134059,"threshold_uncertainty_score":0.01048452,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04037929659307958,"score_gpt":0.3040357363686432,"score_spread":0.2636564397755636,"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."}}