{"id":"W2086354937","doi":"10.1145/1227161.1370601","title":"A graph approach to the threshold all-against-all substring matching problem","year":2008,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Substring; Graph; Matching (statistics); Computer science; Upper and lower bounds; Mathematics; Algorithm; Running time; Combinatorics; Theoretical computer science; Data structure; Statistics","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.0005261036,0.0002706069,0.000317442,0.0001875986,0.000371685,0.0002139821,0.003387294,0.00007413769,0.000002890218],"category_scores_gemma":[0.00001792335,0.0001798309,0.0002017599,0.0003975285,0.00006300141,0.001114813,0.001430006,0.0004791737,0.00001277368],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001111675,"about_ca_system_score_gemma":0.00008256482,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000298656,"about_ca_topic_score_gemma":4.773954e-7,"domain_scores_codex":[0.9976785,0.00006630614,0.0006261578,0.000355868,0.0008179328,0.0004552845],"domain_scores_gemma":[0.9982752,0.00006989576,0.0003503752,0.0008921089,0.0001228867,0.0002895296],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006811259,0.01088069,0.002323747,0.0001202962,0.002487837,0.003986133,0.1818836,0.07783013,0.3361888,0.06028068,0.1320465,0.1912905],"study_design_scores_gemma":[0.01475848,0.005646412,0.005122724,0.001201437,0.0002241466,0.03634652,0.01519343,0.4029352,0.3516121,0.03232943,0.1281274,0.006502755],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.291038,0.003535003,0.7008393,0.00125509,0.00109342,0.0004571293,0.000009218993,0.000090024,0.001682815],"genre_scores_gemma":[0.4225859,0.0002388486,0.575327,0.001361649,0.0004133609,0.00001346654,0.000005609704,0.00002421639,0.00002993174],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3251051,"threshold_uncertainty_score":0.7333291,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04409935035977574,"score_gpt":0.2762889576835892,"score_spread":0.2321896073238134,"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."}}