{"id":"W2514119406","doi":"10.1137/1.9781611974782.26","title":"Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time","year":2017,"lang":"en","type":"preprint","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Compressed suffix array; Suffix tree; Generalized suffix tree; Alphabet; String (physics); Suffix; Time complexity; Binary logarithm; Parsing; Algorithm; Linear space; Spacetime; Suffix array; Computer science; Discrete mathematics; Combinatorics; Mathematics; Tree (set theory); Data structure; Physics","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.0002644113,0.000245585,0.0004888286,0.0002401129,0.00008942957,0.0001691183,0.001851947,0.0002506308,0.00004394765],"category_scores_gemma":[0.00009053133,0.0002130373,0.00009089096,0.00008018212,0.000174577,0.0001376219,0.00357282,0.0004044176,0.00004192787],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004009761,"about_ca_system_score_gemma":0.000213009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002940795,"about_ca_topic_score_gemma":0.000007611771,"domain_scores_codex":[0.9982327,0.00007694298,0.0004553228,0.0006350557,0.0003685788,0.0002313736],"domain_scores_gemma":[0.9973511,0.0001344621,0.0005226667,0.001794248,0.0001179022,0.0000796874],"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.0002829756,0.003183588,0.009928459,0.0026716,0.0003178288,0.0005943312,0.003770971,0.2560475,0.01062381,0.1146748,0.006506199,0.5913979],"study_design_scores_gemma":[0.0003333832,0.00003684173,0.003546063,0.0004026697,0.000007403222,0.00001208766,0.000005252629,0.9902679,0.002175979,0.002452735,0.0005020934,0.0002575489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06403605,0.0001318901,0.9290926,0.0001987947,0.001835134,0.0004518092,0.00007811128,0.0001475527,0.004028036],"genre_scores_gemma":[0.7080682,0.00003743994,0.2913608,0.00001845324,0.0001261002,0.00002137318,0.00005152126,0.00001615868,0.0002999211],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7342204,"threshold_uncertainty_score":0.868741,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02086790557803845,"score_gpt":0.2765672924671403,"score_spread":0.2556993868891019,"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."}}