{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001037651,0.0007150365,0.0009530944,0.0004707739,0.0004853593,0.001087904,0.001066762,0.001832564,0.002934123],"category_scores_gemma":[0.007686931,0.0004333555,0.000458977,0.001309318,0.001173082,0.002096464,0.001325309,0.001383739,0.0005796084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008815369,"about_ca_system_score_gemma":0.001764714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003527504,"about_ca_topic_score_gemma":0.002241469,"domain_scores_codex":[0.9991601,0.0003856583,0.00002753017,0.0001299732,0.0001855852,0.0001112715],"domain_scores_gemma":[0.9975955,0.001900777,0.0001323724,0.0001513844,0.0001651263,0.00005479435],"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.0001770125,0.00003464076,0.0003946127,0.0001559751,0.00004530606,0.0002973882,0.0001175732,0.8064181,0.004385964,0.1428255,0.002103432,0.04304445],"study_design_scores_gemma":[0.00001968197,0.0000266665,0.0000682359,0.00001304909,0.00000855792,0.00008863716,0.00002416176,0.9209235,0.00265363,0.07502435,0.001137102,0.0000125319],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02937823,0.0006561681,0.9633305,0.0008527279,0.00006908618,0.0000331147,0.0001185265,0.000217299,0.005344284],"genre_scores_gemma":[0.7625408,0.001789371,0.227682,0.0003285364,0.0002228031,0.0001340365,0.0003292723,0.0002237479,0.006749303],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003527504,"threshold_uncertainty_score":0.009815633,"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."}}