{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001179464,0.0002549329,0.0002835308,0.0006609585,0.0005083552,0.0007137397,0.002765317,0.0001067818,0.000002460121],"category_scores_gemma":[0.0001556322,0.000222607,0.00007888844,0.00383736,0.0002258821,0.0008672961,0.001109913,0.0002651768,0.00001730416],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001127802,"about_ca_system_score_gemma":0.0002198679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001044628,"about_ca_topic_score_gemma":0.00007147701,"domain_scores_codex":[0.9970809,0.000045376,0.000333636,0.001029292,0.0006284721,0.0008823474],"domain_scores_gemma":[0.9977611,0.0008417596,0.0001318438,0.0009838705,0.000118157,0.0001632792],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001684352,0.00007589209,0.01240554,0.00005692664,0.000003386864,0.0000469491,0.0004865536,0.1923096,0.001069656,0.0009207394,0.0001278194,0.7924801],"study_design_scores_gemma":[0.0004972806,0.0001140046,0.01317531,0.00006067058,0.000001476899,0.000008476748,6.941726e-7,0.9588229,0.0089589,0.0177467,0.0003286735,0.0002849294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06280087,0.00002958283,0.9349056,0.0006795682,0.0007548386,0.0003969605,0.00001012335,0.0004172505,0.000005176305],"genre_scores_gemma":[0.7496452,0.000001976675,0.2496683,0.0004920437,0.0001213058,0.00003900518,0.00001988078,0.00001160145,6.960871e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7921951,"threshold_uncertainty_score":0.907765,"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."}}