{"id":"W2104887572","doi":"10.1109/icme.2004.1394285","title":"Length-constrained MAP decoding revisited","year":2005,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Decoding methods; Directed acyclic graph; Maximum a posteriori estimation; Parameterized complexity; Algorithm; Sequential decoding; Markov chain; Directed graph; Path (computing); Sequence (biology); Computer science; Heuristic; Binary number; Graph; Mathematics; List decoding; Mathematical optimization; Theoretical computer science; Maximum likelihood; Concatenated error correction code; Block code","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.0001344676,0.00008996538,0.00008155488,0.00001486414,0.0000579223,0.00001889459,0.0001155671,0.00009380807,0.0001829976],"category_scores_gemma":[0.00005580946,0.00006672062,0.00006515735,0.00003899925,0.00003354596,0.000001426586,0.00008330138,0.00005062212,0.0000764912],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005064545,"about_ca_system_score_gemma":0.00001049883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001280115,"about_ca_topic_score_gemma":0.0000036111,"domain_scores_codex":[0.9993832,0.00002502682,0.0001366468,0.0002232296,0.00004428993,0.000187614],"domain_scores_gemma":[0.9997354,0.00001015966,0.00002946881,0.000140511,0.0000293429,0.00005514788],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002283638,0.00003682728,0.002591205,0.000007154166,0.00002560701,0.000002135606,0.000006893531,0.00002192933,0.886586,0.001384695,0.006620467,0.1026943],"study_design_scores_gemma":[0.0005924386,0.0002518723,0.001388178,0.00001652029,0.00001121356,0.00002505139,0.00004563736,0.001358986,0.3292308,0.0001147622,0.6665922,0.0003723878],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9447805,0.0005476989,0.006401281,0.0009061242,0.00007322868,0.00009941165,0.000003155784,0.00005729725,0.04713128],"genre_scores_gemma":[0.9859135,0.0000287665,0.01023057,0.001313063,0.0005029675,0.000001717597,0.00004394627,0.000005709956,0.001959767],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6599717,"threshold_uncertainty_score":0.2720788,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01311920673767464,"score_gpt":0.2550749679610169,"score_spread":0.2419557612233422,"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."}}