{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002229725,0.000166508,0.0002723376,0.00001288908,0.0002983632,0.0002474972,0.0003467131,0.0001775929,0.00000642155],"category_scores_gemma":[0.00001861604,0.0001396191,0.0001804233,0.00006930091,0.00006874368,0.00007350959,0.0004171095,0.0001741236,0.000003199012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000135124,"about_ca_system_score_gemma":0.00009445684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002274816,"about_ca_topic_score_gemma":0.000001158848,"domain_scores_codex":[0.998923,0.000006910908,0.0002651119,0.0003446289,0.0002054359,0.0002549216],"domain_scores_gemma":[0.9990888,0.0002303026,0.0001119546,0.0004063848,0.00005957334,0.0001029942],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001112223,0.0001833379,0.000002396144,0.000118787,0.0001276826,0.000002481671,0.003025231,0.00001775113,0.01687501,0.8587773,0.02533747,0.0955214],"study_design_scores_gemma":[0.01063806,0.0002231791,0.00001575556,0.0003093573,0.0002031314,0.00005485885,0.003828952,0.1455541,0.1746322,0.442821,0.2201766,0.001542815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01477678,0.000127755,0.9693556,0.0004115436,0.0004264753,0.0007562273,0.00008440802,0.0002581791,0.01380299],"genre_scores_gemma":[0.05529948,0.0000230227,0.940127,0.0005505056,0.0007962716,0.0001974535,0.00007195917,0.00003962531,0.00289472],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4159563,"threshold_uncertainty_score":0.5693502,"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."}}