Nongreedy Unbalanced Huffman Tree Compressor for Single and Multifasta Files-Reference-Cited by-同舟云学术

Nongreedy Unbalanced Huffman Tree Compressor for Single and Multifasta Files

Published:2020-06-01 Issue:6 Volume:27 Page:868-876
ISSN:1557-8666
Container-title:Journal of Computational Biology
language:en
Short-container-title:Journal of Computational Biology

Author:

Alyami Sultan¹,Huang Chun-Hsi¹

Affiliation:

1. Department of Computer Science & Engineering, University of Connecticut, Storrs, Connecticut.

Publisher

Mary Ann Liebert Inc

Subject

Computational Theory and Mathematics,Computational Mathematics,Genetics,Molecular Biology,Modelling and Simulation

Link

https://www.liebertpub.com/doi/pdf/10.1089/cmb.2019.0249

Reference21 articles.

1. Alberti, C., Mattavelli, M., Hernandez, A., et al. 2015. Investigation on genomic information compression and storage. Presented at ISO/IEC JTC1, Geneva.

2. Toward a Better Compression for DNA Sequences Using Huffman Encoding

3. DNACompress: fast and effective DNA sequence compression

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Does Deflate Outperform Huffman Lossless Compression?;2023 IEEE 9th International Conference on Computing, Engineering and Design (ICCED);2023-11-07

2. Classifying and discovering genomic sequences in metagenomic repositories;Procedia Computer Science;2023

3. Efficient compression of SARS-CoV-2 genome data using Nucleotide Archival Format;Patterns;2022-09

4. The value of compression for taxonomic identification;2022 IEEE 35th International Symposium on Computer-Based Medical Systems (CBMS);2022-07

5. A brief review on DNA storage, compression, and digitalization;Nano Communication Networks;2022-03