{"id":"W2552773400","doi":"10.1016/j.jda.2016.11.002","title":"A prefix array for parameterized strings","year":2016,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Parameterized complexity; Prefix; Mathematics; Combinatorics; Computer science; Algorithm","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.0005773138,0.0001720326,0.0003431132,0.0001409071,0.00009961522,0.0001600621,0.001170344,0.00007046901,0.00001728406],"category_scores_gemma":[0.0001585271,0.00009224996,0.0002541393,0.000162282,0.00004793462,0.00149358,0.0001602468,0.0001156313,0.000009387378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004984501,"about_ca_system_score_gemma":0.000102469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003861364,"about_ca_topic_score_gemma":2.998353e-7,"domain_scores_codex":[0.9983596,0.00005521373,0.0005659072,0.0002572911,0.0004321212,0.000329831],"domain_scores_gemma":[0.9982147,0.000296548,0.000559609,0.0004547495,0.0002648914,0.0002095259],"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.0002119838,0.0001566264,0.0001367166,0.00003308132,0.0001856202,0.00005036541,0.0003618918,0.0000135712,0.128863,0.003641445,0.009545245,0.8568004],"study_design_scores_gemma":[0.02347988,0.007509196,0.004349162,0.001977752,0.0002280813,0.001376479,0.0001643869,0.03266963,0.2817386,0.1030712,0.5412311,0.002204462],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003368718,0.0002429515,0.9934925,0.001712287,0.000847343,0.0001569036,0.00004429497,0.00003510115,0.00009988854],"genre_scores_gemma":[0.05054508,0.0001548786,0.9481072,0.0001569961,0.0006175464,0.00001414267,0.000002085676,0.00002065205,0.0003814561],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.854596,"threshold_uncertainty_score":0.3761844,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01945847956967942,"score_gpt":0.2734673835023682,"score_spread":0.2540089039326887,"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."}}