{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007991678,0.00008661222,0.000145908,0.0005930062,0.0001426073,0.0004507879,0.003106747,0.00002135507,0.00001533108],"category_scores_gemma":[0.00007495401,0.00007413107,0.00008957984,0.0005666798,0.0002821248,0.002953683,0.0003384411,0.0001190805,0.000006532252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008216152,"about_ca_system_score_gemma":0.0004469518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003827829,"about_ca_topic_score_gemma":0.000001959123,"domain_scores_codex":[0.9979684,0.00002815468,0.0006266754,0.0001983068,0.001024876,0.0001535874],"domain_scores_gemma":[0.9969563,0.000130074,0.0007266736,0.0002983072,0.001823152,0.0000654635],"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.00002367518,0.0004985578,0.008741543,0.000009059233,0.00007822462,0.00005783187,0.0005999533,0.01059366,0.04643398,0.3504277,0.002036352,0.5804994],"study_design_scores_gemma":[0.002517735,0.0006150616,0.04471935,0.0006070099,0.0000252436,0.00384547,0.00007203867,0.7017835,0.08808294,0.1310316,0.02595063,0.0007493932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05123765,0.00003450314,0.9436024,0.0008094556,0.003293236,0.0000328117,0.000002883912,0.00001702918,0.0009700202],"genre_scores_gemma":[0.5254032,0.000004517166,0.4741986,0.00003982863,0.0003399554,3.283346e-7,0.000001036714,0.000001874385,0.00001065468],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6911898,"threshold_uncertainty_score":0.577316,"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."}}