Software—Practice & Experience
Text compression
A new challenge for compression algorithms: genetic sequences
Information Processing and Management: an International Journal - Special issue: data compression
Arithmetic coding for data compression
Communications of the ACM
Data compression via textual substitution
Journal of the ACM (JACM)
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Managing gigabytes (2nd ed.): compressing and indexing documents and images
A compression algorithm for DNA sequences and its applications in genome comparison
RECOMB '00 Proceedings of the fourth annual international conference on Computational molecular biology
Fast and flexible word searching on compressed text
ACM Transactions on Information Systems (TOIS)
Experiments in text file compression
Communications of the ACM
Compression of Strings with Approximate Repeats
ISMB '98 Proceedings of the 6th International Conference on Intelligent Systems for Molecular Biology
Data and Knowledge Bases for Genome Mapping: What Lies Ahead? (Panel)
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
A Guaranteed Compression Scheme for Repetitive DNA Sequences
DCC '96 Proceedings of the Conference on Data Compression
DCC '99 Proceedings of the Conference on Data Compression
Compression of Biological Sequences by Greedy Off-Line Textual Substitution
DCC '00 Proceedings of the Conference on Data Compression
DNA sequence compression using the normalized maximum likelihood model for discrete regression
DCC '03 Proceedings of the Conference on Data Compression
An efficient normalized maximum likelihood algorithm for DNA sequence compression
ACM Transactions on Information Systems (TOIS)
On Compressibility of Protein Sequences
DCC '06 Proceedings of the Data Compression Conference
An Introduction to Kolmogorov Complexity and Its Applications
An Introduction to Kolmogorov Complexity and Its Applications
Partial retrieval of compressed semi-structured documents
International Journal of Computer Applications in Technology
DNA compression challenge revisited: a dynamic programming approach
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Modelling-Alignment for non-random sequences
AI'04 Proceedings of the 17th Australian joint conference on Advances in Artificial Intelligence
The context-tree weighting method: basic properties
IEEE Transactions on Information Theory
Domain information based prediction of protein-protein interactions of glucosinolate biosynthesis
International Journal of Computer Applications in Technology
| Hi-index | 0.00 |
This paper introduces a novel algorithm for DNA sequence compression that makes use of a transformation and statistical properties within the transformed sequence. A word based tagged code is used for identification of end of code. The word based encoder uses frequency distribution for assigning the code of words. The designed compression algorithm is efficient and effective for DNA sequence compression. As a statistical compression method, it is able to search the pattern inside the compressed text which is useful in knowledge discovery. Experiments show that our algorithm is shown to outperform existing compressors on typical DNA sequence datasets.