{"id":"W2029114055","doi":"10.1109/tit.2004.830782","title":"Monotonicity-Based Fast Algorithms for MAP Estimation of Markov Sequences Over Noisy Channels","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":25,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Maximum a posteriori estimation; Algorithm; Markov chain; Mathematics; Decoding methods; Computational complexity theory; Sequence (biology); Directed acyclic graph; Forward algorithm; Monotonic function; Markov model; Variable-order Markov model","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.000277528,0.0001114586,0.0001026286,0.0000773306,0.0001173783,0.00002233265,0.0001070168,0.0001276231,0.00001874354],"category_scores_gemma":[0.00001416523,0.0000937158,0.0001163027,0.00007506458,0.00007145153,0.00002850527,0.000001361216,0.00006450738,0.000009414778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000235013,"about_ca_system_score_gemma":0.00005863929,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007197219,"about_ca_topic_score_gemma":0.000001342965,"domain_scores_codex":[0.9993554,0.00003162779,0.0002750758,0.0001080034,0.00009441888,0.0001354279],"domain_scores_gemma":[0.999574,0.000040504,0.0001306503,0.000132262,0.00008672071,0.00003586069],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0004607479,0.0001110519,0.000002662507,0.00009944572,0.0000474124,1.269207e-7,0.0001714025,0.8667639,0.0260608,0.001215493,0.00002927165,0.1050377],"study_design_scores_gemma":[0.001377925,0.0007991072,0.00003998356,0.00005028835,0.00002485673,0.00000248197,0.0001456562,0.04711642,0.9460066,0.003287842,0.0009366172,0.0002122196],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1268243,0.0000107814,0.8722795,0.00007232583,0.0002704184,0.0002734481,0.00008424115,0.00002245861,0.0001624965],"genre_scores_gemma":[0.9893545,0.000005937528,0.01000527,0.0003875166,0.00003435387,0.00005558418,0.0001114575,0.000005349692,0.00004002012],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9199458,"threshold_uncertainty_score":0.382162,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01048673774791291,"score_gpt":0.2543342481356515,"score_spread":0.2438475103877386,"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."}}