Relative Lempel-Ziv Compression of Genomes for Large-Scale Storage and Retrieval

DOI10.1007/978-3-642-16321-0_20zbMath1397.68073OpenAlexW2137661542MaRDI QIDQ3162880

Shanika Kuruppu, Simon J. Puglisi, Justin Zobel

Publication date: 22 October 2010

Published in: String Processing and Information Retrieval (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-16321-0_20

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Genetics and epigenetics (92D10) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items

On-line string matching in highly similar DNA sequences ⋮ Block graphs in practice ⋮ FM-index of alignment: a compressed index for similar strings ⋮ On the approximation ratio of LZ-end to LZ77 ⋮ On compressing and indexing repetitive sequences ⋮ Faster repetition-aware compressed suffix trees based on block trees ⋮ Sensitivity of string compressors and repetitiveness measures ⋮ Random access in persistent strings and segment selection ⋮ FM-index of alignment with gaps ⋮ Lempel-Ziv-like parsing in small space ⋮ Generalized substring compression ⋮ Unnamed Item ⋮ GraCT: a grammar-based compressed index for trajectory data ⋮ Fast relative Lempel-Ziv self-index for similar sequences ⋮ Algorithms for Indexing Highly Similar DNA Sequences ⋮ Self-indexing Based on LZ77 ⋮ Dynamic relative compression, dynamic partial sums, and substring concatenation ⋮ Direct merging of delta encoded files ⋮ Refining the \(r\)-index ⋮ Approximate pattern matching in LZ77-compressed texts ⋮ Faster Compressed Suffix Trees for Repetitive Collections ⋮ Online LZ77 Parsing and Matching Statistics with RLBWTs