Limits...
On-Demand Indexing for Referential Compression of DNA Sequences.

Alves F, Cogo V, Wandelt S, Leser U, Bessani A - PLoS ONE (2015)

Bottom Line: Referential compression is one of these techniques, in which the similarity between the DNA of organisms of the same or an evolutionary close species is exploited to reduce the storage demands of genome sequences up to 700 times.The general idea is to store in the compressed file only the differences between the to-be-compressed and a well-known reference sequence.Our approach, called On-Demand Indexing (ODI) compresses human chromosomes five to ten times faster than other state-of-the-art tools (on average), while achieving similar compression ratios.

View Article: PubMed Central - PubMed

Affiliation: LaSIGE, University of Lisbon, Lisbon, Portugal.

ABSTRACT
The decreasing costs of genome sequencing is creating a demand for scalable storage and processing tools and techniques to deal with the large amounts of generated data. Referential compression is one of these techniques, in which the similarity between the DNA of organisms of the same or an evolutionary close species is exploited to reduce the storage demands of genome sequences up to 700 times. The general idea is to store in the compressed file only the differences between the to-be-compressed and a well-known reference sequence. In this paper, we propose a method for improving the performance of referential compression by removing the most costly phase of the process, the complete reference indexing. Our approach, called On-Demand Indexing (ODI) compresses human chromosomes five to ten times faster than other state-of-the-art tools (on average), while achieving similar compression ratios.

No MeSH data available.


Different matching techniques used in our compression algorithm.ODI uses: (a) Direct match. (b) SNP test. (c) Brute-force search. (d) Index lookup.
© Copyright Policy
Related In: Results  -  Collection

License
getmorefigures.php?uid=PMC4493149&req=5

pone.0132460.g003: Different matching techniques used in our compression algorithm.ODI uses: (a) Direct match. (b) SNP test. (c) Brute-force search. (d) Index lookup.

Mentions: Fig 3 illustrates these four steps, which are described in detail in the following paragraphs. Any of these steps immediately returns a match to the compression algorithm (described above) or returns no match.


On-Demand Indexing for Referential Compression of DNA Sequences.

Alves F, Cogo V, Wandelt S, Leser U, Bessani A - PLoS ONE (2015)

Different matching techniques used in our compression algorithm.ODI uses: (a) Direct match. (b) SNP test. (c) Brute-force search. (d) Index lookup.
© Copyright Policy
Related In: Results  -  Collection

License
Show All Figures
getmorefigures.php?uid=PMC4493149&req=5

pone.0132460.g003: Different matching techniques used in our compression algorithm.ODI uses: (a) Direct match. (b) SNP test. (c) Brute-force search. (d) Index lookup.
Mentions: Fig 3 illustrates these four steps, which are described in detail in the following paragraphs. Any of these steps immediately returns a match to the compression algorithm (described above) or returns no match.

Bottom Line: Referential compression is one of these techniques, in which the similarity between the DNA of organisms of the same or an evolutionary close species is exploited to reduce the storage demands of genome sequences up to 700 times.The general idea is to store in the compressed file only the differences between the to-be-compressed and a well-known reference sequence.Our approach, called On-Demand Indexing (ODI) compresses human chromosomes five to ten times faster than other state-of-the-art tools (on average), while achieving similar compression ratios.

View Article: PubMed Central - PubMed

Affiliation: LaSIGE, University of Lisbon, Lisbon, Portugal.

ABSTRACT
The decreasing costs of genome sequencing is creating a demand for scalable storage and processing tools and techniques to deal with the large amounts of generated data. Referential compression is one of these techniques, in which the similarity between the DNA of organisms of the same or an evolutionary close species is exploited to reduce the storage demands of genome sequences up to 700 times. The general idea is to store in the compressed file only the differences between the to-be-compressed and a well-known reference sequence. In this paper, we propose a method for improving the performance of referential compression by removing the most costly phase of the process, the complete reference indexing. Our approach, called On-Demand Indexing (ODI) compresses human chromosomes five to ten times faster than other state-of-the-art tools (on average), while achieving similar compression ratios.

No MeSH data available.