{"id":"W2169465650","doi":"10.1007/11880561_31","title":"A New Algorithm for Fast All-Against-All Substring Matching","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Substring; Algorithm; Matching (statistics); Computer science; Graph; String searching algorithm; Mathematics; Theoretical computer science; Pattern matching; Data structure; Artificial intelligence; 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.001351351,0.002214771,0.002833091,0.00362113,0.001874166,0.002697002,0.004573793,0.002393701,0.01630316],"category_scores_gemma":[0.004617528,0.001098792,0.001528361,0.005154038,0.001009982,0.006649171,0.004874553,0.002270727,0.01038551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001044701,"about_ca_system_score_gemma":0.002212202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001708086,"about_ca_topic_score_gemma":0.00349711,"domain_scores_codex":[0.9973157,0.0002543436,0.0002867245,0.0007064904,0.001195117,0.0002415845],"domain_scores_gemma":[0.9974918,0.0006018998,0.0001338812,0.0009541702,0.0006888142,0.0001293602],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0005247638,0.0001938315,0.0003840879,0.000260596,0.00008947394,0.0001359285,0.0001038934,0.007313495,0.02552502,0.01206983,0.02581935,0.9275797],"study_design_scores_gemma":[0.0006883081,0.0008797668,0.001502918,0.0001309325,0.0003738071,0.003123772,0.0003417627,0.5925707,0.1100111,0.1378664,0.1522485,0.0002619723],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005411331,0.0007070375,0.9800544,0.0002324355,0.000490592,0.0002554164,0.000444604,0.008629891,0.003774137],"genre_scores_gemma":[0.02449267,0.000321542,0.9638252,0.0002208487,0.0001759601,0.0002364541,0.00163919,0.0007766974,0.008311406],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01630316,"threshold_uncertainty_score":0.0545395,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01842756406257322,"score_gpt":0.2523865924585631,"score_spread":0.2339590283959899,"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."}}