A new challenge for compression algorithms: Genetic sequences

DOI10.1016/0306-4573(94)90014-0MaRDI QIDQ1345812zbMATH OpenOpenAlexFDO

Authors Stéphane Grumbach, Fariza Tahi

Publication date 30 May 1995

Published in Information Processing and Management (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/inria-00180949/file/grumbach.pdf

zbMATH Keywords

palindromesbiocompress-2comprehension of genetic sequencescompression of DNA

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20) Data encryption (aspects in computer science) (68P25) Software, source code, etc. for problems pertaining to biology (92-04) Theory of data (68P99)

Recommendations

• Combinatorial Pattern Matching
• Efficient storage of massive biological sequences in compact form
• Improved compression of DNA sequencing data with cascading Bloom filters
• Textual data compression in computational biology: algorithmic techniques
• Comparison between text compression algorithms in biological sequences

Cited in

(11)

• Artificial sequences and complexity measures
• Phylogenetic analysis of DNA sequences based on the generalized pseudo-amino acid composition
• Searching for smallest grammars on large sequences and application to DNA
• Bacterial DNA sequence compression models using artificial neural networks
• De Novo NGS Data Compression
• Textual data compression in computational biology: algorithmic techniques
• The use of genetic programming for adaptive text compression
• Comparison between text compression algorithms in biological sequences
• Efficient storage of massive biological sequences in compact form
• Combinatorial Pattern Matching
• Data compression and learning in time sequences analysis

This page was built for publication: A new challenge for compression algorithms: Genetic sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1345812)