{"id":"W2294639780","doi":"","title":"Reconstructing a suffix array","year":2005,"lang":"en","type":"article","venue":"Murdoch Research Repository (Murdoch University)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Lexicographical order; Suffix array; Compressed suffix array; Suffix tree; Suffix; Generalized suffix tree; Computer science; String (physics); Data structure; Alphabet; Simple (philosophy); Construct (python library); Algorithm; Theoretical computer science; 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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001006262,0.0002482964,0.000271177,0.0009676596,0.001565377,0.000559583,0.00274059,0.0001705601,0.00005656127],"category_scores_gemma":[0.0001138424,0.0002563265,0.0001436254,0.001860331,0.0003186527,0.002476701,0.00120267,0.0009193259,0.000241211],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005238785,"about_ca_system_score_gemma":0.0004616433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003109737,"about_ca_topic_score_gemma":0.0000230325,"domain_scores_codex":[0.9958825,0.0006549142,0.0003093997,0.001016769,0.001126766,0.001009655],"domain_scores_gemma":[0.9969429,0.0003821505,0.0001295908,0.00148383,0.0005737909,0.0004877718],"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.0003029344,0.001243609,0.01046226,0.0001851135,0.0003291005,0.004900545,0.00471055,0.0006370047,0.2154366,0.3447301,0.04023255,0.3768296],"study_design_scores_gemma":[0.001359492,0.0003116478,0.0009844813,0.0001903635,0.0000145341,0.000538737,0.001043247,0.04104827,0.05956573,0.0007863612,0.8933648,0.0007923351],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.241695,0.0006321242,0.2947316,0.002719647,0.001560174,0.000894024,0.00001596787,0.001218055,0.4565334],"genre_scores_gemma":[0.8385729,0.0001273433,0.1200902,0.00008999619,0.001205371,0.000005876714,0.00001190002,0.00003986866,0.03985645],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8531322,"threshold_uncertainty_score":0.9999889,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04307785103725692,"score_gpt":0.284097871430358,"score_spread":0.2410200203931011,"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."}}