{"id":"W2058305583","doi":"10.1142/s0129054106004418","title":"RECONSTRUCTING A SUFFIX ARRAY","year":2006,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lexicographical order; Suffix array; Compressed suffix array; Suffix tree; Generalized suffix tree; Suffix; Computer science; String (physics); Data structure; Alphabet; Simple (philosophy); Construct (python library); Algorithm; Mathematics; Theoretical computer science; Combinatorics; Programming language","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.0007639028,0.0006853499,0.0009137875,0.001264197,0.0007603365,0.001631043,0.001128298,0.001318368,0.004143095],"category_scores_gemma":[0.007410724,0.0005618757,0.0008251046,0.002446195,0.0007106903,0.003295461,0.001330153,0.001360756,0.004110718],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003210173,"about_ca_system_score_gemma":0.00106103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004121014,"about_ca_topic_score_gemma":0.0004213204,"domain_scores_codex":[0.999091,0.0001741473,0.0001038213,0.0002406566,0.000309917,0.00008037151],"domain_scores_gemma":[0.9961156,0.001340851,0.0002719977,0.001471899,0.0007097772,0.00008990488],"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.0008127522,0.0001149667,0.002821564,0.0008337127,0.000109745,0.0008107008,0.0007069268,0.04386954,0.1430141,0.08285236,0.008889862,0.7151638],"study_design_scores_gemma":[0.00007901213,0.0005703606,0.001151643,0.0001564075,0.0001365956,0.003228647,0.0006578643,0.435919,0.3409586,0.1334976,0.08353029,0.0001140049],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03348666,0.0003767973,0.9594282,0.0002799148,0.0001986124,0.000077779,0.000593302,0.002392726,0.003166046],"genre_scores_gemma":[0.1013125,0.0005156328,0.8905549,0.0001198169,0.00007536605,0.00008403033,0.002076361,0.00047421,0.004787202],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004143095,"threshold_uncertainty_score":0.01385999,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01205037815274377,"score_gpt":0.2796258498087055,"score_spread":0.2675754716559617,"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."}}