{"id":"W2248630842","doi":"","title":"A fixed-parameter algorithm for string-to-string correction","year":2010,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"String (physics); Character (mathematics); Integer (computer science); Algorithm; Simple (philosophy); Boyer–Moore string search algorithm; String searching algorithm; Computer science; Commentz-Walter algorithm; Tree (set theory); Mathematics; Discrete mathematics; Combinatorics; Data structure; Geometry","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.000190703,0.0001163638,0.0001144515,0.0001028301,0.0001607381,0.0002364088,0.0005971273,0.00007050393,0.00003123405],"category_scores_gemma":[0.00008069273,0.00009626344,0.00005771316,0.0002176089,0.00001136086,0.000515726,0.0003331898,0.0001678926,0.00006949052],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001504568,"about_ca_system_score_gemma":0.00003087191,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005940535,"about_ca_topic_score_gemma":0.00003008385,"domain_scores_codex":[0.9989905,0.00001010153,0.0001607542,0.0004006034,0.0001693071,0.0002686822],"domain_scores_gemma":[0.9990182,0.0001713128,0.00004396361,0.0005346621,0.00008895595,0.0001429285],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002294271,0.00003086095,0.00006855535,0.000001884125,0.000004279309,0.000001213347,0.0000464208,0.00002156314,0.00277093,0.00309735,0.01043732,0.9835173],"study_design_scores_gemma":[0.0003255406,0.0001372956,0.0007924383,0.0000125016,0.000003489653,0.00002068621,0.00001130862,0.8920882,0.02822627,0.001028261,0.07713094,0.0002230284],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006676306,0.000004670047,0.9884107,0.0001790991,0.00379501,0.0002697907,0.000007291318,0.0002397724,0.0004173658],"genre_scores_gemma":[0.03563284,0.000001195536,0.9619583,0.0002991191,0.0002932614,0.00005598566,0.000008460973,0.000009979869,0.001740866],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9832943,"threshold_uncertainty_score":0.3925509,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01224209445447154,"score_gpt":0.2625452371130331,"score_spread":0.2503031426585616,"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."}}