{"id":"W2379852994","doi":"","title":"A Modified Burrows-Wheeler Transform Compression Algorithm Based On Least Frequently Used Replacement","year":2008,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Lossless compression; Computer science; Algorithm; Compression (physics); Compression ratio; Data compression; Sorting; Block (permutation group theory); Mathematics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001743079,0.0003720726,0.0003223128,0.00024363,0.0007517855,0.0001600544,0.00154717,0.0001349056,0.0000351805],"category_scores_gemma":[4.968869e-7,0.0003329165,0.0001675711,0.0005503463,0.00009354007,0.0004432643,0.0002733766,0.0003153737,0.0002179369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001228058,"about_ca_system_score_gemma":0.0001290405,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005680809,"about_ca_topic_score_gemma":0.000002055501,"domain_scores_codex":[0.9973306,0.00007415933,0.0005131065,0.00103124,0.0005543185,0.0004965662],"domain_scores_gemma":[0.9979016,0.0001026808,0.0001627961,0.00144458,0.0001334386,0.0002549258],"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.00005669865,0.002281842,0.0001310254,0.00005580919,0.00006178799,0.00004111468,0.001094417,0.01152421,0.01007129,0.008202811,0.02946132,0.9370177],"study_design_scores_gemma":[0.001526786,0.0001426533,0.0004940918,0.00004811564,0.000008493647,0.0000458488,0.00000541729,0.7196243,0.00627734,0.0006057841,0.2707886,0.0004325393],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007787683,0.00007214939,0.994631,0.001172508,0.0000751205,0.001279796,0.00007108868,0.0004965234,0.001423071],"genre_scores_gemma":[0.05946922,0.00002378839,0.9371579,0.001548355,0.0002567172,0.0008731562,0.0002571301,0.00003978962,0.0003739819],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9365851,"threshold_uncertainty_score":0.9999123,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02083155621015893,"score_gpt":0.2451250473243288,"score_spread":0.2242934911141699,"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."}}