[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Voges et al., 2016 - Google Patents

Predictive coding of aligned next-generation sequencing data

Voges et al., 2016

Document ID
2164884442086820551
Author
Voges J
Munderloh M
Ostermann J
Publication year
Publication venue
2016 Data Compression Conference (DCC)

External Links

Snippet

Due to novel high-throughput next-generation sequencing technologies, the sequencing of huge amounts of genetic information has become affordable. On account of this flood of data, IT costs have become a major obstacle compared to sequencing costs. High …
Continue reading at ieeexplore.ieee.org (other versions)

Classifications

    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same information or similar information or a subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/40—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
    • H03M7/4031—Fixed length to variable length coding
    • H03M7/4037—Prefix coding
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same information or similar information or a subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/3084—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction using adaptive string matching, e.g. the Lempel-Ziv method
    • H03M7/3088—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction using adaptive string matching, e.g. the Lempel-Ziv method employing the use of a dictionary, e.g. LZ78
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same information or similar information or a subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/3084—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction using adaptive string matching, e.g. the Lempel-Ziv method
    • H03M7/3086—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction using adaptive string matching, e.g. the Lempel-Ziv method employing a sliding window, e.g. LZ77
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same information or similar information or a subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/60—General implementation details not specific to a particular type of compression
    • H03M7/6064—Selection of Compressor
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
    • H03M13/39—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
    • H03M13/41—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors

Similar Documents

Publication Publication Date Title
CN110603595B (en) Methods and systems for reconstructing genomic reference sequences from compressed genomic sequence reads
US10090857B2 (en) Method and apparatus for compressing genetic data
KR101969848B1 (en) Method and apparatus for compressing genetic data
CN110021369B (en) Gene sequencing data compression and decompression method, system and computer readable medium
WO2019076177A1 (en) Gene sequencing data compression preprocessing, compression and decompression method, system, and computer-readable medium
Voges et al. Predictive coding of aligned next-generation sequencing data
EP3583249B1 (en) Method and systems for the reconstruction of genomic reference sequences from compressed genomic sequence reads
US12125562B2 (en) Quality value compression framework in aligned sequencing data based on novel contexts
Long et al. GeneComp, a new reference-based compressor for SAM files
JP2020509474A (en) Methods and systems for reconstructing genomic reference sequences from compressed genomic sequence reads
Cánovas et al. Practical compression for multi-alignment genomic files
JP2020503580A (en) Method and apparatus for compact representation of bioinformatics data
KR20190113971A (en) Compression representation method and apparatus of bioinformatics data using multiple genome descriptors
Roy et al. Sbvrldnacomp: An effective dna sequence compression algorithm
EP3652862A1 (en) Method for encoding and decoding of quality values of a data structure
Saha et al. NRRC: A Non-referential Reads Compression Algorithm
AU2017399715A1 (en) Method and systems for the reconstruction of genomic reference sequences from compressed genomic sequence reads
JP2020510907A (en) Method and system for efficient compression of genome sequence reads
KR102729412B1 (en) Efficient compression method and system for genome sequence reads
Benoit et al. De Novo NGS Data Compression
Mittal LOSSLESS DATA COMPRESSION FOR ENERGY EFFICIENT TRANSMISSION OVER WIRELESS NETWORK.
FI115937B (en) Lossless data compression and decompression
JP2022549580A (en) Methods for compression of genomic sequence data
Paris A new compression algorithm based on the locality principle of information