Storage and Retrieval of Individual Genomes

DOI10.1007/978-3-642-02008-7_9MaRDI QIDQ3630150zbMATH OpenOpenAlexFDO

Authors Veli Mäkinen, Jouni Sirén, Niko Välimäki, Gonzalo Navarro

Publication date 3 June 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2008/1674/

zbMATH Keywords

comparative genomicscompressed data structuresfull-text indexingsuffix tree

Mathematics Subject Classification ID

Data structures (68P05) Database theory (68P15) Information storage and retrieval of data (68P20) Genetics and epigenetics (92D10)

Recommendations

• Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
• Relative Lempel-Ziv compression of genomes for large-scale storage and retrieval
• Indexing highly repetitive collections
• Flexible indexing of repetitive collections
• On compressing and indexing repetitive sequences

Cited in

(9)

• FM-index of alignment with gaps
• Top tree compression of tries
• FM-index of alignment: a compressed index for similar strings
• Relative Lempel-Ziv compression of genomes for large-scale storage and retrieval
• Indexing similar DNA sequences
• Linking BWT and XBW via Aho-Corasick automaton: applications to run-length encoding
• Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
• scientific article; zbMATH DE number 7651154 (Why is no real title available?)
• A compressed dynamic self-index for highly repetitive text collections

This page was built for publication: Storage and Retrieval of Individual Genomes

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