{"id":"W2133601898","doi":"10.1145/780542.780590","title":"A sublinear algorithm for weakly approximating edit distance","year":2003,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Edit distance; Substring; Sublinear function; Character (mathematics); Computer science; Upper and lower bounds; Algorithm; Time complexity; Combinatorics; Mathematics; Data structure","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.0003525734,0.0001156416,0.0001324832,0.00003948867,0.0001862986,0.000209423,0.0005381719,0.00004233614,0.00002528548],"category_scores_gemma":[0.00007722557,0.00009087849,0.0000538982,0.0002251618,0.00001917648,0.0006473481,0.0001182354,0.00007135347,0.00002360929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001836128,"about_ca_system_score_gemma":0.00004639633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008441734,"about_ca_topic_score_gemma":0.000001461065,"domain_scores_codex":[0.998902,0.00002643795,0.0002132041,0.0003686599,0.000202642,0.0002870915],"domain_scores_gemma":[0.999161,0.0001021223,0.00007296547,0.0004871734,0.00008821298,0.0000884937],"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.000001448726,0.00008566769,0.00002259298,0.00001722122,0.000008385879,0.000003422145,0.0001009828,0.00002167441,0.0001667745,0.3493327,0.01991879,0.6303203],"study_design_scores_gemma":[0.0002582598,0.00003662186,0.00001026018,0.00001097154,0.000001599832,0.000007333214,0.00002214317,0.788049,0.001739349,0.006700237,0.2030222,0.0001420216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002935968,0.0001150091,0.993771,0.000152593,0.0005758943,0.0002095001,0.00001332224,0.0001804012,0.00495299],"genre_scores_gemma":[0.001543341,0.00000464766,0.9966773,0.0001949573,0.0001618157,0.00004512654,0.00001025977,0.000008784915,0.001353796],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7880273,"threshold_uncertainty_score":0.3705917,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01491292570024554,"score_gpt":0.2482037933123638,"score_spread":0.2332908676121183,"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."}}