{"id":"W2110015277","doi":"10.1145/1645953.1646134","title":"Suffix trees for very large genomic sequences","year":2009,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Generalized suffix tree; Suffix tree; Compressed suffix array; Suffix; Computer science; String (physics); Theoretical computer science; Data structure; String searching algorithm; Suffix array; Tree (set theory); Algorithm; Mathematics; Programming language; Combinatorics","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.0009768645,0.0007140573,0.0009340851,0.00188831,0.001052457,0.00215345,0.001469945,0.001432743,0.008451243],"category_scores_gemma":[0.01009564,0.0006161577,0.0008352539,0.004534812,0.001006706,0.004321119,0.001779583,0.002662073,0.009145329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005712049,"about_ca_system_score_gemma":0.000852429,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000450996,"about_ca_topic_score_gemma":0.0008070716,"domain_scores_codex":[0.998708,0.000266069,0.000181285,0.0002111043,0.0005640004,0.00006947062],"domain_scores_gemma":[0.9967659,0.001547887,0.0002945845,0.0007727829,0.0005048837,0.0001140043],"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.0003942157,0.00009222038,0.001119376,0.001836345,0.0001111048,0.001345125,0.0007484752,0.02578494,0.04335499,0.3282919,0.07561591,0.5213053],"study_design_scores_gemma":[0.00007317259,0.000103234,0.000631039,0.0003018757,0.00003932872,0.001510273,0.0001581757,0.1030844,0.01434448,0.7084318,0.1712622,0.00006005562],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00644851,0.005317847,0.969359,0.001239248,0.0006034269,0.0001488888,0.003644729,0.006911403,0.006326876],"genre_scores_gemma":[0.06245834,0.006280638,0.9119214,0.0006600982,0.0006016447,0.0004817598,0.01040376,0.001303527,0.005888951],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008451243,"threshold_uncertainty_score":0.02827227,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0171675373083366,"score_gpt":0.2631299366913453,"score_spread":0.2459623993830087,"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."}}