{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004709355,0.0005283522,0.0005772859,0.0009504334,0.0003841194,0.0008149108,0.0009652738,0.0004028885,0.001938808],"category_scores_gemma":[0.001472936,0.000222675,0.0003463152,0.001172384,0.0005712588,0.001344318,0.000620213,0.0006199335,0.001086372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004588558,"about_ca_system_score_gemma":0.0007552771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001690318,"about_ca_topic_score_gemma":0.001875141,"domain_scores_codex":[0.9996062,0.00003526647,0.00002001879,0.00004125821,0.000259598,0.0000376046],"domain_scores_gemma":[0.9996148,0.0001308751,0.0000482819,0.00009371142,0.00009611477,0.00001616779],"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.0004922601,0.0001978596,0.000886917,0.0002683845,0.00005737624,0.0002315553,0.0002042358,0.1342911,0.1115757,0.04553105,0.004242524,0.7020212],"study_design_scores_gemma":[0.00009540809,0.0001576949,0.0003879867,0.00001611996,0.00002230169,0.0003328831,0.00004654557,0.8742841,0.1014665,0.01266851,0.01049407,0.0000277922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02215593,0.0003246088,0.9739575,0.0001163311,0.00005291417,0.0000915485,0.0000525967,0.001397023,0.001851535],"genre_scores_gemma":[0.1232123,0.0005049625,0.8712499,0.00008690025,0.00004748608,0.0001542522,0.0002970961,0.0002196421,0.004227401],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001938808,"threshold_uncertainty_score":0.006485999,"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."}}