{"id":"W1485068757","doi":"10.1109/pacrim.2003.1235900","title":"Distributed multidimensional suffix arrays for string search","year":2004,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Suffix; Computer science; Pointer (user interface); Suffix tree; Generalized suffix tree; Compressed suffix array; Data structure; String (physics); String searching algorithm; Theoretical computer science; Suffix array; Algorithm; Artificial intelligence; Mathematics; 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.0001503844,0.0000834332,0.00008614365,0.00003831001,0.0001766421,0.00007288425,0.0004041228,0.00003509278,0.00001301333],"category_scores_gemma":[0.00002140549,0.00006470619,0.00004437349,0.0001525585,0.00001756267,0.0003758828,0.0003153479,0.00007082267,0.00003135563],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004073705,"about_ca_system_score_gemma":0.00007812328,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007615939,"about_ca_topic_score_gemma":0.000004617296,"domain_scores_codex":[0.9991037,0.0000100083,0.0001232418,0.00029072,0.0002188155,0.0002534703],"domain_scores_gemma":[0.9993777,0.00007568862,0.00002058967,0.0003386065,0.00008842258,0.0000990246],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002259168,0.0003168962,0.0001728142,0.00001941125,0.00002081382,0.00001766144,0.0002025316,0.02157646,0.01451209,0.9339296,0.003332829,0.02587628],"study_design_scores_gemma":[0.004546182,0.0003122856,0.003719056,0.00008057751,0.000006165408,0.00003324768,0.00008116456,0.7996275,0.1433246,0.01894733,0.0287247,0.0005972055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01341168,0.00002080632,0.9852967,0.0006510942,0.000182185,0.0001573303,0.00004726745,0.0001428221,0.00009010724],"genre_scores_gemma":[0.3010631,0.000002810883,0.6985809,0.0001057999,0.00007146521,0.00001133981,0.00008287559,0.000004999327,0.00007670492],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9149823,"threshold_uncertainty_score":0.2638642,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02673894112890789,"score_gpt":0.276574704709041,"score_spread":0.2498357635801331,"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."}}