{"id":"W2136702169","doi":"10.1109/aina.2007.109","title":"Parallel Lossless Data Compression Based on the Burrows-Wheeler Transform","year":2007,"lang":"en","type":"article","venue":"Proceedings","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Parallel computing; Lossless compression; Speedup; Task parallelism; Distributed memory; Data parallelism; Data compression; Parallelism (grammar); Algorithm; Shared memory","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001065977,0.0001937627,0.0001506385,0.00008403982,0.0003523329,0.0002945246,0.003227889,0.00008054141,0.00004403948],"category_scores_gemma":[0.00004238623,0.0001155728,0.00004182365,0.0003224628,0.00006318845,0.001035871,0.0005737237,0.0002922572,0.00005683076],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002686748,"about_ca_system_score_gemma":0.00003381614,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001980511,"about_ca_topic_score_gemma":0.000002165615,"domain_scores_codex":[0.9981256,0.000007896663,0.0002534097,0.0005972963,0.0006010583,0.0004147218],"domain_scores_gemma":[0.9987065,0.0001497326,0.00009980505,0.0008138381,0.00009853915,0.0001315489],"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.0003901758,0.0009320812,0.002002803,0.0001845366,0.00004374414,0.00004795776,0.002070398,0.0001859913,0.006889544,0.2046994,0.240302,0.5422513],"study_design_scores_gemma":[0.0006601841,0.0001076588,0.00241433,0.0001730732,0.000008252056,0.00001002451,0.00008406772,0.8389505,0.004981512,0.002642241,0.1496451,0.0003231026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004960982,0.00008927189,0.9617895,0.005933013,0.0003845248,0.0004118896,0.00002060221,0.0002808755,0.02612932],"genre_scores_gemma":[0.9287769,0.00002111081,0.06807981,0.00252051,0.0002801659,0.00001897537,0.00004256518,0.0000235913,0.0002364251],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9238158,"threshold_uncertainty_score":0.5998275,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04755587612790663,"score_gpt":0.2806979466130523,"score_spread":0.2331420704851457,"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."}}