Evidence map›Paper›PMID 25344501›Full record

ArticleBioinformatics (Oxford, England)2015

iDoComp: a compression scheme for assembled genomes.

Idoia Ochoa, Mikel Hernaez, Tsachy Weissman

Abstract read
In one paragraph

Article in Bioinformatics (Oxford, England), 2015. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 18 papers, 1 of them a synthesis that pooled it.

0numbers the graph read from it
0cells of the map it votes in
18citing papers in PubMed, 1 pooled it
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

18 citing papers in PubMed, 1 synthesis or guideline pooled it.

  1. Pooled it
  2. Article
  3. Review
  4. Review
  5. Article
  6. Article
  7. Article
  8. Article
  9. Article
  10. Article
  11. Article
  12. Article
  13. Article
  14. NRGC: a novel referential genome compression algorithm.Bioinformatics (Oxford, England) · 2016
    Article
  15. Article
  16. ERGC: an efficient referential genome compression algorithm.Bioinformatics (Oxford, England) · 2015
    Article
  17. Article
  18. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Idoia OchoaDepartment of Electrical Engineering, Stanford University, 350 Serra Mall, Stanford, CA.
Mikel HernaezDepartment of Electrical Engineering, Stanford University, 350 Serra Mall, Stanford, CA.
Tsachy WeissmanDepartment of Electrical Engineering, Stanford University, 350 Serra Mall, Stanford, CA.

Funding

Genomic Compression: From Information Theory to Parallel AlgorithmsU01CA198943 · NCI · UNIVERSITY OF ILLINOIS AT URBANA-CHAMPAIGN · PI MILENKOVIC, OLGICA, WEISSMAN, TSACHY · 2015 to 2017
$1.4M
NCI NIH HHS U01 CA198943
6 · The paper itself

Abstract

motivationWith the release of the latest next-generation sequencing (NGS) machine, the HiSeq X by Illumina, the cost of sequencing a Human has dropped to a mere $4000. Thus we are approaching a milestone in the sequencing history, known as the $1000 genome era, where the sequencing of individuals is affordable, opening the doors to effective personalized medicine. Massive generation of genomic data, including assembled genomes, is expected in the following years. There is crucial need for compression of genomes guaranteed of performing well simultaneously on different species, from simple bacteria to humans, which will ease their transmission, dissemination and analysis. Further, most of the new genomes to be compressed will correspond to individuals of a species from which a reference already exists on the database. Thus, it is natural to propose compression schemes that assume and exploit the availability of such references.

resultsWe propose iDoComp, a compressor of assembled genomes presented in FASTA format that compresses an individual genome using a reference genome for both the compression and the decompression. In terms of compression efficiency, iDoComp outperforms previously proposed algorithms in most of the studied cases, with comparable or better running time. For example, we observe compression gains of up to 60% in several cases, including H.sapiens data, when comparing with the best compression performance among the previously proposed algorithms. AVAILABILITY: iDoComp is written in C and can be downloaded from: http://www.stanford.edu/~iochoa/iDoComp.html (We also provide a full explanation on how to run the program and an example with all the necessary files to run it.).

Indexed as

Databases, FactualGenome, HumanSoftwareAlgorithmsData CompressionGenomicsHigh-Throughput Nucleotide SequencingHumansPrecision MedicineSequence Analysis, DNA

Identifiers

PMID25344501
PMCPMC5855886

What OpenQuestion holds

Textmetadata
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.