{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009827442,0.001105567,0.00143205,0.002078808,0.001148497,0.001792978,0.003702557,0.002394763,0.006212946],"category_scores_gemma":[0.005142552,0.0005812465,0.00118245,0.003637419,0.001804037,0.007516992,0.002444325,0.002575781,0.001443755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001315675,"about_ca_system_score_gemma":0.001639012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002291968,"about_ca_topic_score_gemma":0.002545702,"domain_scores_codex":[0.9981322,0.0004676917,0.0001015582,0.0006508942,0.0004920409,0.0001556794],"domain_scores_gemma":[0.9971619,0.001380364,0.000319483,0.0006915762,0.0002789361,0.0001677525],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003556849,0.0004007122,0.001283303,0.0005991646,0.0001283913,0.0004753618,0.0003990645,0.3700523,0.01364108,0.3918029,0.01663437,0.2042276],"study_design_scores_gemma":[0.00004637883,0.0001171596,0.0002118751,0.00002399903,0.00004752797,0.0003657291,0.0001224716,0.6491219,0.003385541,0.3361694,0.01035721,0.00003082389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008863348,0.0002044784,0.9870735,0.0005383464,0.00004820365,0.0001025455,0.0002485078,0.0005092125,0.002411787],"genre_scores_gemma":[0.1669865,0.0007569353,0.8245127,0.0005720321,0.0001769001,0.0002523141,0.001344067,0.0002946015,0.005103995],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006212946,"threshold_uncertainty_score":0.02078438,"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."}}