{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006776529,0.0006613413,0.0009193636,0.002886146,0.001074307,0.002281876,0.001779958,0.0009322788,0.00425968],"category_scores_gemma":[0.003337897,0.0006030211,0.0006412755,0.004120093,0.0008605702,0.004512735,0.001969306,0.001400093,0.003412049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005221892,"about_ca_system_score_gemma":0.001164868,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001113192,"about_ca_topic_score_gemma":0.001581525,"domain_scores_codex":[0.9989738,0.00009440088,0.000130471,0.0002142517,0.0005348311,0.00005222159],"domain_scores_gemma":[0.9978899,0.0004050058,0.0001342408,0.000888726,0.0005688226,0.0001132413],"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.0003364975,0.0001602403,0.001295813,0.0003725163,0.00008001216,0.0001961601,0.0003742356,0.007494613,0.07751346,0.03011221,0.01809538,0.8639688],"study_design_scores_gemma":[0.000403206,0.0006460121,0.002167689,0.0001432324,0.0001838003,0.003044547,0.0004601188,0.4063272,0.2147609,0.09646088,0.275126,0.0002765525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005283499,0.0004234557,0.9875777,0.0001671534,0.0001865439,0.00009074637,0.0004843812,0.004505625,0.001280971],"genre_scores_gemma":[0.02591315,0.0003536372,0.9686806,0.0001065916,0.0001072816,0.0001615066,0.001337226,0.000431492,0.002908606],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00425968,"threshold_uncertainty_score":0.01425004,"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."}}