{"id":"W2022963826","doi":"10.1109/tcomm.2006.877945","title":"Length-constrained MAP decoding of variable-length encoded Markov sequences","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Decoding methods; Maximum a posteriori estimation; Markov chain; Directed acyclic graph; Mathematics; Parameterized complexity; Algorithm; Directed graph; Markov process; Path (computing); Sequential decoding; Sequence (biology); Binary number; Markov model; Mathematical optimization; Computer science; Maximum likelihood; 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.0009090945,0.0005546605,0.0008539537,0.0003854638,0.0003397412,0.0007860842,0.0007524162,0.001054154,0.001668934],"category_scores_gemma":[0.006199908,0.0003969161,0.0004179096,0.0008069351,0.0008406478,0.001809181,0.0009305697,0.0008414797,0.00040412],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008553124,"about_ca_system_score_gemma":0.001559498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002620591,"about_ca_topic_score_gemma":0.001782481,"domain_scores_codex":[0.9993622,0.0002684888,0.00002506507,0.0001116696,0.0001467765,0.00008584104],"domain_scores_gemma":[0.997076,0.002392621,0.0001978,0.0001446669,0.0001452067,0.00004360216],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000256291,0.00002948076,0.0003441611,0.0001007505,0.0000250653,0.0001198594,0.00009122091,0.9137051,0.004854076,0.04294977,0.0005287796,0.03699538],"study_design_scores_gemma":[0.00001457926,0.00002362071,0.00005893793,0.000006739315,0.000004285853,0.00002677323,0.00001427807,0.9765617,0.003252355,0.01976233,0.0002673283,0.000007061139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0641003,0.0001940763,0.9333312,0.0002326288,0.00001806279,0.00003529242,0.0001276769,0.0002530783,0.001707659],"genre_scores_gemma":[0.7822512,0.0004755281,0.2114488,0.0000945876,0.00005157033,0.0001340125,0.0004482737,0.0001625752,0.004933434],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002620591,"threshold_uncertainty_score":0.006205738,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02030513829016469,"score_gpt":0.2612639241017747,"score_spread":0.24095878581161,"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."}}