{"id":"W3211412965","doi":"10.54216/fpa.060103","title":"Design of Effective Lossless Data Compression Technique for Multiple Genomic DNA Sequences","year":2021,"lang":"en","type":"article","venue":"Fusion Practice and Applications","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Huffman coding; Arithmetic coding; Lossless compression; Computer science; Data compression; Context-adaptive binary arithmetic coding; Coding (social sciences); Data compression ratio; Compression ratio; Algorithm; Tunstall coding; Image compression; Artificial intelligence; Mathematics; Image processing; Engineering","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.0004891891,0.00009225497,0.0001375343,0.0000391463,0.0002909799,0.00008175591,0.0006739665,0.00006084917,0.000005095491],"category_scores_gemma":[0.0002094534,0.00007914795,0.00001745122,0.0002220052,0.00004522758,0.0008976518,0.001032942,0.00009028936,0.000004134058],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001113452,"about_ca_system_score_gemma":0.0001021977,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003038048,"about_ca_topic_score_gemma":0.000001856857,"domain_scores_codex":[0.9989307,0.0001413662,0.0002005401,0.0004801672,0.0001340689,0.000113188],"domain_scores_gemma":[0.9966669,0.001802549,0.0002179064,0.001025334,0.0002320625,0.00005522749],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003381767,0.0002793969,0.00002889596,0.00006069957,0.0000182963,0.000002964053,0.000131792,0.0001722665,0.8325884,0.008165657,0.001702929,0.1568148],"study_design_scores_gemma":[0.0009979693,0.0001727853,0.0006972753,0.000170121,0.00009019619,0.0001452203,0.0003652281,0.3202349,0.3630622,0.008994672,0.3046721,0.0003973595],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000273436,0.0006046974,0.9968832,0.000627091,0.00004981763,0.001291946,0.0001179823,0.00004009017,0.0001117103],"genre_scores_gemma":[0.06348424,0.0006359767,0.9342229,0.0001951624,0.00007957494,0.001068747,0.0002661265,0.000009608601,0.00003767943],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4695262,"threshold_uncertainty_score":0.322756,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04651959199295155,"score_gpt":0.3301289388760781,"score_spread":0.2836093468831266,"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."}}