{"id":"W3142663085","doi":"10.14778/3447689.3447695","title":"On the string matching with <i>k</i> differences in DNA databases","year":2021,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Substring; Suffix tree; String (physics); String searching algorithm; Combinatorics; Pattern matching; Trie; Bounded function; Speedup; Sequence (biology); Tree (set theory); Computer science; Alphabet; Matching (statistics); Time complexity; Mathematics; Algorithm; Data structure; Artificial intelligence; Parallel computing; Biology","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.0002071596,0.0001060783,0.0001234272,0.00003135132,0.0001302187,0.0001236756,0.0009245466,0.00001192356,0.000007891535],"category_scores_gemma":[0.00004560508,0.00004799947,0.00002947785,0.0003123159,0.00003399324,0.0003300711,0.0008947942,0.000143876,0.000001755604],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002475593,"about_ca_system_score_gemma":0.00003215627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000723674,"about_ca_topic_score_gemma":0.00001159463,"domain_scores_codex":[0.9990072,0.00001092691,0.0001534969,0.0002641207,0.0003917341,0.0001725554],"domain_scores_gemma":[0.9994144,0.0001267555,0.0001189421,0.0002559141,0.00005718732,0.00002673627],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003536715,0.0003687512,0.01382128,0.0000956593,0.00004208716,0.00000960576,0.002085361,0.00007842822,0.04198414,0.9297407,0.001879935,0.009858673],"study_design_scores_gemma":[0.001333401,0.0002310317,0.03556282,0.002769536,0.00002688281,0.00006431035,0.002456913,0.008515589,0.8967133,0.04974991,0.002041308,0.0005350271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9889802,0.0001157928,0.005643086,0.002867679,0.0001411615,0.0002122191,0.000009052142,0.00003350289,0.001997251],"genre_scores_gemma":[0.9935663,0.00003165136,0.006019874,0.0002679556,0.00002144747,0.00002050959,7.479634e-7,0.000004473598,0.00006702098],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8799908,"threshold_uncertainty_score":0.1957361,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02468333589081975,"score_gpt":0.2204707003077575,"score_spread":0.1957873644169377,"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."}}