{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009112704,0.0007786278,0.001272008,0.00143264,0.0011789,0.002928112,0.001865156,0.001148156,0.004879049],"category_scores_gemma":[0.009928531,0.0006425462,0.0008159383,0.004104141,0.00134603,0.005589493,0.003399807,0.001457958,0.003143405],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001346658,"about_ca_system_score_gemma":0.003300475,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001225103,"about_ca_topic_score_gemma":0.002007738,"domain_scores_codex":[0.9969006,0.0003901021,0.0002765784,0.0005055602,0.001561477,0.0003658388],"domain_scores_gemma":[0.9945357,0.001979377,0.0003904443,0.001982725,0.0009676344,0.0001441336],"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.001022791,0.0003975643,0.002927223,0.0008784478,0.0001362084,0.0008009266,0.001170422,0.07145294,0.08399906,0.2627505,0.03753301,0.536931],"study_design_scores_gemma":[0.0002491572,0.0002554324,0.0009132921,0.0001287055,0.0001158379,0.0008982616,0.000414956,0.5083775,0.1556548,0.2901888,0.04268721,0.0001161255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05904864,0.001002067,0.9145896,0.0008124212,0.0002685893,0.0003055856,0.001800628,0.0100218,0.01215063],"genre_scores_gemma":[0.3059379,0.0005615648,0.6795884,0.0004523523,0.0001923581,0.0005504999,0.004637266,0.001149137,0.006930389],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004879049,"threshold_uncertainty_score":0.01632208,"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."}}