{"id":"W2047243384","doi":"10.1145/1458082.1458170","title":"A new method for indexing genomes using on-disk suffix trees","year":2008,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Search engine indexing; Compressed suffix array; Suffix tree; Trie; Suffix; Merge (version control); sort; Generalized suffix tree; Suffix array; Binary tree; String (physics); String searching algorithm; Substring; Data structure; Theoretical computer science; Parallel computing; Algorithm; Artificial intelligence; Mathematics; Database; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001426673,0.0001086955,0.0001386019,0.00008437284,0.0002463015,0.00007648892,0.0005250117,0.00003362143,0.00002834019],"category_scores_gemma":[0.00001759878,0.00008200289,0.00006333747,0.0001762623,0.00001009486,0.0004059575,0.000232981,0.00005935626,0.00001063159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002512041,"about_ca_system_score_gemma":0.0001097026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002514534,"about_ca_topic_score_gemma":0.0000108029,"domain_scores_codex":[0.9991136,0.00002663073,0.00014276,0.0003249787,0.0001703336,0.0002216983],"domain_scores_gemma":[0.999239,0.0001672813,0.00004945034,0.0004076228,0.00003235774,0.0001042773],"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.00003176153,0.0001205875,0.0007169556,0.00001248572,0.00004293934,0.00003964488,0.001858179,0.004516288,0.003128096,0.09465054,0.01909538,0.8757871],"study_design_scores_gemma":[0.0004422079,0.0001000607,0.0005000691,0.00001602668,0.000003622806,0.00004834295,0.00002216661,0.9624121,0.003252462,0.003890331,0.02912257,0.0001900948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001586775,0.0001339119,0.9965963,0.0001904408,0.0001978577,0.0001285298,0.000003418137,0.0001162074,0.001046542],"genre_scores_gemma":[0.00626692,0.00001297104,0.9919869,0.0003489253,0.0001686991,0.000003708024,0.000002619576,0.00000784326,0.001201362],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9578958,"threshold_uncertainty_score":0.3343981,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06883198086595334,"score_gpt":0.3371902277071298,"score_spread":0.2683582468411765,"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."}}