{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002375553,0.000141822,0.0001550718,0.00006355024,0.0003122896,0.00001929626,0.0005852929,0.0001476852,0.00005169276],"category_scores_gemma":[0.00001403591,0.0001299088,0.0001195129,0.0001769293,0.0002725777,0.000006642477,0.00001221031,0.0001871425,0.000008186882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000172179,"about_ca_system_score_gemma":0.00006981704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001337948,"about_ca_topic_score_gemma":0.0001410104,"domain_scores_codex":[0.9989847,0.0001597584,0.0003413228,0.0002276045,0.0000922582,0.0001943825],"domain_scores_gemma":[0.9987448,0.000147064,0.0001142178,0.0008461495,0.0001039647,0.00004374795],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005759123,0.000589577,0.0002450966,0.0000248715,0.0001079743,6.63616e-7,0.000035988,0.004190196,0.9740997,0.002821469,0.0003222988,0.01750458],"study_design_scores_gemma":[0.001587603,0.0008817565,0.0006810668,0.0001654931,0.0001788775,0.00004129067,0.0004464611,0.01425043,0.9496244,0.003318453,0.02791393,0.0009102827],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2882737,0.0008376924,0.680864,0.001175151,0.0004070339,0.0004497088,0.0002188567,0.0001166383,0.02765727],"genre_scores_gemma":[0.9657426,0.0002149469,0.03332208,0.0000879775,0.0000449367,0.00002931261,0.0000732034,0.00001100621,0.0004739503],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6774689,"threshold_uncertainty_score":0.5297526,"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."}}