{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007210764,0.0006093319,0.0007931356,0.001326075,0.0006469717,0.001359044,0.0009285056,0.001020117,0.004549704],"category_scores_gemma":[0.007307816,0.0004398448,0.0006650254,0.002568821,0.0006666118,0.002548607,0.00109811,0.001293584,0.003971912],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003284405,"about_ca_system_score_gemma":0.0008530607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00043672,"about_ca_topic_score_gemma":0.000437404,"domain_scores_codex":[0.9991535,0.000171843,0.00009724124,0.0002046625,0.0003012139,0.00007156539],"domain_scores_gemma":[0.9958422,0.001480575,0.0002866519,0.001492013,0.0008016714,0.0000968796],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009247576,0.0001231824,0.00339817,0.0006166329,0.0001149836,0.0008780912,0.0005722863,0.046852,0.1098917,0.07356976,0.01173031,0.7513282],"study_design_scores_gemma":[0.00009346586,0.0005198452,0.001218945,0.0001587152,0.000124729,0.002631719,0.0005028523,0.5112773,0.2977709,0.1103047,0.07531878,0.00007808196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05693978,0.0005278494,0.9335696,0.0004290575,0.0003632005,0.00009032687,0.0007200559,0.002629166,0.004731054],"genre_scores_gemma":[0.1501745,0.0004443556,0.8395419,0.0001559228,0.0001007446,0.00008709362,0.002468556,0.0004440085,0.006582937],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004549704,"threshold_uncertainty_score":0.01522028,"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."}}