{"id":"W1545746670","doi":"10.1109/dcc.1998.672253","title":"Higher compression from the Burrows-Wheeler transform by modified sorting","year":2002,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Substring; Sorting; Computer science; Algorithm; ASCII; Character (mathematics); Lossless compression; Sorting algorithm; Data compression; sort; Compression (physics); Encoding (memory); Compression ratio; Set (abstract data type); Theoretical computer science; Mathematics; Artificial intelligence; Information retrieval","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003023686,0.0004824426,0.0005473671,0.001095634,0.0003482912,0.0009805472,0.0006949155,0.0004875698,0.01849353],"category_scores_gemma":[0.001671274,0.0001250746,0.0003769996,0.002349039,0.0004000449,0.001152205,0.0007194699,0.0009436615,0.00488462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005393189,"about_ca_system_score_gemma":0.0004049412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001420846,"about_ca_topic_score_gemma":0.001522192,"domain_scores_codex":[0.9995925,0.00002814558,0.00003005152,0.0000382131,0.0002691384,0.00004191624],"domain_scores_gemma":[0.9992855,0.0002340682,0.00003067388,0.0002022606,0.0002265272,0.00002096694],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006522703,0.0001204408,0.0008415268,0.0005545151,0.00005040476,0.001003896,0.0002869722,0.02540592,0.1448096,0.06744016,0.06042602,0.6984082],"study_design_scores_gemma":[0.0001766784,0.0004133163,0.002747415,0.000174767,0.0001041381,0.001994232,0.0001578502,0.3518064,0.3304655,0.03969291,0.2721215,0.000145131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1712852,0.006308263,0.6996413,0.002906994,0.005784483,0.0003444217,0.004323437,0.01370672,0.09569927],"genre_scores_gemma":[0.4652785,0.002787654,0.4504034,0.00102529,0.001792084,0.0002870314,0.008919771,0.001579051,0.06792721],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01849353,"threshold_uncertainty_score":0.06186706,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03153017270255547,"score_gpt":0.231984474489101,"score_spread":0.2004543017865455,"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."}}