{"id":"W2073984053","doi":"10.1016/j.is.2010.11.001","title":"Suffix trees for inputs larger than main memory","year":2010,"lang":"en","type":"article","venue":"Information Systems","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Generalized suffix tree; Compressed suffix array; Suffix tree; Suffix; Computer science; String (physics); String searching algorithm; Auxiliary memory; Algorithm; Data structure; Tree (set theory); Theoretical computer science; Construct (python library); Mathematics; Combinatorics; Programming language","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.001072093,0.0008068533,0.00111484,0.001117282,0.001045291,0.002678054,0.0009422123,0.00159084,0.01594142],"category_scores_gemma":[0.01659769,0.0004463868,0.0006615922,0.002823147,0.0007220164,0.007163558,0.001734076,0.001821414,0.005745178],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007972741,"about_ca_system_score_gemma":0.001147785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000423872,"about_ca_topic_score_gemma":0.0008422121,"domain_scores_codex":[0.9987137,0.0001778165,0.0002081468,0.0002516231,0.0004554554,0.0001932515],"domain_scores_gemma":[0.9895011,0.006014266,0.0003026752,0.002591215,0.001449021,0.0001418294],"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.002044137,0.000209043,0.002892161,0.001460381,0.0000771652,0.001315372,0.0006833046,0.02712713,0.04701823,0.1557847,0.05761214,0.7037762],"study_design_scores_gemma":[0.0001331102,0.0003241956,0.001541008,0.0004017874,0.0001217052,0.001990197,0.000492499,0.2457206,0.1162075,0.5646312,0.06837243,0.00006369554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.159353,0.003844738,0.7711512,0.00515351,0.001282013,0.0004624957,0.00956334,0.01279479,0.03639489],"genre_scores_gemma":[0.4684532,0.002229136,0.4816467,0.0009910755,0.0007907649,0.0004993488,0.01193025,0.002518694,0.03094074],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01594142,"threshold_uncertainty_score":0.05332935,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01017456959835393,"score_gpt":0.2344620922604449,"score_spread":0.224287522662091,"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."}}