{"id":"W4386870921","doi":"10.1007/978-3-031-43980-3_19","title":"A Simple Grammar-Based Index for Finding Approximately Longest Common Substrings","year":2023,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University","funders":"National Human Genome Research Institute; Natural Sciences and Engineering Research Council of Canada; Directorate for Biological Sciences; Agencia Nacional de Investigación y Desarrollo; National Institutes of Health; National Science Foundation","keywords":"Substring; Combinatorics; Correctness; Grammar; Computer science; Simple (philosophy); Mathematics; Algorithm; Data structure; Programming language; Linguistics","routes":{"ca_aff":true,"ca_fund":true,"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.000775738,0.0007537966,0.001996081,0.006608822,0.001022972,0.001795513,0.001944264,0.0009955055,0.005136686],"category_scores_gemma":[0.006179977,0.0005114653,0.0008792446,0.006947926,0.0007931287,0.003202293,0.002138222,0.0008884807,0.00291249],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006491168,"about_ca_system_score_gemma":0.002500484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002040235,"about_ca_topic_score_gemma":0.004510024,"domain_scores_codex":[0.9985338,0.0001481982,0.0002157946,0.0003474927,0.0006518843,0.0001028594],"domain_scores_gemma":[0.9958444,0.001569015,0.0003182823,0.001003094,0.001031846,0.0002333932],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008995932,0.0004219243,0.005555516,0.0006663097,0.0001548341,0.0006169552,0.000510205,0.01152346,0.09566309,0.01712396,0.01841738,0.8484467],"study_design_scores_gemma":[0.0006934595,0.001720144,0.01129982,0.0002374073,0.0006339381,0.003912911,0.0009929581,0.6508189,0.08248269,0.1843809,0.06249451,0.0003324033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1149547,0.001538116,0.8617038,0.0003234895,0.0003276652,0.0005942195,0.005953497,0.009509221,0.005095233],"genre_scores_gemma":[0.1800204,0.0004990074,0.8037736,0.0002091696,0.0002098532,0.0003696187,0.01044956,0.0008448554,0.003623891],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006608822,"threshold_uncertainty_score":0.01718396,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03003959799901033,"score_gpt":0.2919689418882067,"score_spread":0.2619293438891964,"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."}}