Comparison between text compression algorithms in biological sequences

DOI10.1016/J.IC.2019.104466MaRDI QIDQ2288216zbMATH OpenOpenAlexFDO

Authors Fotios Kounelis, Christos Makris

Publication date 17 January 2020

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2019.104466

zbMATH Keywords

bioinformaticsbiological sequencesindex compressioninformation retrievalinterpolative codinginverted indexOptPFD compression

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32) Computational methods for problems pertaining to biology (92-08)

Recommendations

• Combinatorial Pattern Matching
• Efficient storage of massive biological sequences in compact form
• A new challenge for compression algorithms: Genetic sequences
• Fast relative Lempel-Ziv self-index for similar sequences
• Compressed text indexes, from theory to practice

Cites work

• scientific article; zbMATH DE number 756768 (Why is no real title available?)
• Inverted file compression through document identifier reassignment.
• When indexing equals compression, experiments with compressing suffix arrays and applications

Cited in

(2)

• A new challenge for compression algorithms: Genetic sequences
• scientific article; zbMATH DE number 2086134 (Why is no real title available?)

This page was built for publication: Comparison between text compression algorithms in biological sequences

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