{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003666327,0.0004467844,0.0004021659,0.000722304,0.0003018919,0.0005466541,0.001007791,0.0005399992,0.001189252],"category_scores_gemma":[0.0009284087,0.0001915933,0.0003036211,0.0006518262,0.0003322455,0.0007852643,0.0003093229,0.0003436664,0.0004686224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004572941,"about_ca_system_score_gemma":0.0005598411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009396537,"about_ca_topic_score_gemma":0.0006920703,"domain_scores_codex":[0.9997188,0.00002831439,0.00001731078,0.00006625797,0.0001482092,0.00002103792],"domain_scores_gemma":[0.9996253,0.00009659831,0.00006294752,0.00002875918,0.0001704774,0.00001590855],"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.0003697116,0.0001546324,0.001365739,0.0003774797,0.00006888818,0.0004471843,0.0002595985,0.07499477,0.4137267,0.01648031,0.003653343,0.4881016],"study_design_scores_gemma":[0.00004643972,0.0004083725,0.0006644429,0.00003511149,0.0000466624,0.0007120605,0.00005610864,0.8324745,0.1560839,0.002079383,0.007362341,0.00003067816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02225577,0.0005054115,0.9748036,0.0001985688,0.0000578104,0.0001040478,0.00005141655,0.00040594,0.001617423],"genre_scores_gemma":[0.4099047,0.001025428,0.5843499,0.0002272993,0.00008724541,0.0003528454,0.0002480051,0.00004739865,0.003757266],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001189252,"threshold_uncertainty_score":0.003978491,"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."}}