{"id":"W2942699488","doi":"10.1109/access.2019.2913339","title":"Construction of Multi-State Capacity-Approaching Variable-Length Constrained Sequence Codes With State-Independent Decoding","year":2019,"lang":"en","type":"article","venue":"IEEE Access","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates; Alberta Innovates - Technology Futures","keywords":"Decoding methods; Encoder; Huffman coding; Computer science; Constraint (computer-aided design); Sequence (biology); Algorithm; State (computer science); Coding (social sciences); Variable (mathematics); Theoretical computer science; Mathematics; Data compression","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007357478,0.0005202487,0.0006223121,0.000546447,0.0004454715,0.0006060335,0.0009906485,0.0005249147,0.001892131],"category_scores_gemma":[0.002834801,0.0003330345,0.0004456615,0.0007672953,0.0009280475,0.0008913072,0.001400626,0.001069188,0.0006000006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006289249,"about_ca_system_score_gemma":0.001752214,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001015852,"about_ca_topic_score_gemma":0.0009614359,"domain_scores_codex":[0.9994183,0.0001365842,0.00003818633,0.00009585806,0.0002392384,0.00007187343],"domain_scores_gemma":[0.9986874,0.0005610749,0.0001461212,0.0002421773,0.0002790532,0.00008416449],"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.0001564198,0.00007086605,0.0004934383,0.0002269157,0.00003348446,0.0003406476,0.0002550338,0.3010747,0.04468352,0.5562629,0.00196211,0.09444001],"study_design_scores_gemma":[0.00003348873,0.0001111766,0.0001308814,0.00003764625,0.00001245263,0.0001793686,0.00002564839,0.8723326,0.04325622,0.07810671,0.005723414,0.00005033375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03277963,0.0001292486,0.9607483,0.0001237575,0.00003786013,0.00009975424,0.0001546882,0.0002930945,0.005633686],"genre_scores_gemma":[0.5055597,0.0002777889,0.4888224,0.000147632,0.00003226698,0.0003806169,0.0005032831,0.00009881457,0.004177484],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001892131,"threshold_uncertainty_score":0.006329775,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04514387786130067,"score_gpt":0.2879050768249769,"score_spread":0.2427611989636762,"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."}}