{"id":"W3120098135","doi":"10.1137/1.9781611976472.5","title":"PFP Compressed Suffix Trees","year":2021,"lang":"en","type":"article","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"National Human Genome Research Institute; National Institute of Allergy and Infectious Diseases; Natural Sciences and Engineering Research Council of Canada; Agencia Nacional de Investigación y Desarrollo; Israel Institute for Biological Research; Research Center for Informatics, Czech Technical University in Prague; National Institutes of Health; National Science Foundation","keywords":"Compressed suffix array; Generalized suffix tree; Suffix tree; Computer science; String (physics); Parsing; Suffix array; Suffix; Concatenation (mathematics); Prefix; Computation; Data structure; Tree (set theory); Theoretical computer science; Algorithm; Combinatorics; Mathematics; Artificial intelligence; Programming language","routes":{"ca_aff":true,"ca_fund":true,"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.0008504616,0.0009226095,0.0009710421,0.001939104,0.001151397,0.002289976,0.002358047,0.001434225,0.01235521],"category_scores_gemma":[0.01124992,0.0006013242,0.0009961834,0.005792564,0.0007089509,0.004688832,0.002257771,0.001580859,0.007754704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008682291,"about_ca_system_score_gemma":0.002260858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002233961,"about_ca_topic_score_gemma":0.002637517,"domain_scores_codex":[0.9982526,0.000259451,0.0002133294,0.0004020884,0.0006927078,0.0001797991],"domain_scores_gemma":[0.9958447,0.001351195,0.0002182715,0.001472419,0.001001859,0.0001116422],"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.0008713241,0.0001943691,0.001618617,0.0007700294,0.00008726513,0.0008397705,0.0005746991,0.03688192,0.02383249,0.07363351,0.1047506,0.7559454],"study_design_scores_gemma":[0.0002923277,0.0003165751,0.001250659,0.0002438214,0.00008867808,0.002079488,0.0004731466,0.4624065,0.056942,0.2519158,0.2238699,0.0001211478],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03294778,0.001529518,0.8882664,0.001267695,0.0006962457,0.0004988686,0.01949965,0.03582596,0.01946779],"genre_scores_gemma":[0.1332439,0.0008581851,0.8126518,0.0005941431,0.0003061223,0.0007144719,0.04020484,0.002229149,0.009197368],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01235521,"threshold_uncertainty_score":0.0413323,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05496279510950445,"score_gpt":0.2515273967201858,"score_spread":0.1965646016106814,"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."}}