Comment on: 'ERGC: an efficient referential genome compression algorithm'.
other · Level V
Where this comes from
- Record sourced from PubMed, PMID 26615213.
- Also identified by DOI 10.1093/bioinformatics/btv704 and PMC identifier 4907388.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
Abstract
Data compression is crucial in effective handling of genomic data. Among several recently published algorithms, ERGC seems to be surprisingly good, easily beating all of the competitors. We evaluated ERGC and the previously proposed algorithms GDC and iDoComp, which are the ones used in the original paper for comparison, on a wide data set including 12 assemblies of human genome (instead of only four of them in the original paper). ERGC wins only when one of the genomes (referential or target) contains mixed-cased letters (which is the case for only the two Korean genomes). In all other cases ERGC is on average an order of magnitude worse than GDC and iDoComp. sebastian.deorowicz@polsl.pl, iochoa@stanford.edu Supplementary data are available at Bioinformatics online.
Medical subject headings
- Data Compression
- Sequence Analysis, DNA