Evidence map›Paper›PMID 24282536›Full record

ArticlePloS one2013

DNA-COMPACT: DNA COMpression based on a pattern-aware contextual modeling technique.

Pinghao Li, Shuang Wang, Jihoon Kim, Hongkai Xiong, Lucila Ohno-Machado, Xiaoqian Jiang

Open access · goldAbstract read
In one paragraph

Article in PloS one, 2013. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 9 papers, 1 of them a synthesis that pooled it.

0numbers the graph read from it
0cells of the map it votes in
9citing papers in PubMed, 1 pooled it
1.5field-weighted citation impact, top 14% of its field
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

9 citing papers in PubMed, 1 synthesis or guideline pooled it, 29 citations in OpenAlex.

  1. Pooled it
  2. Article
  3. Review
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. 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

6 authors at 2 institutions in 2 countries.

Pinghao LiDivision of Biomedical Informatics, University of California San Diego, La Jolla, California, United States of America ; Department of Electronic Engineering, Shanghai Jiao Tong University, Shanghai, China.
Shuang Wang
Jihoon Kim
Hongkai Xiong
Lucila Ohno-Machado
Xiaoqian Jiang
University of California, San Diego · USShanghai Jiao Tong University · CN

Funding

iDASH: Integrating Data for Analysis, Anonymization, and SharingU54HL108460 · NHLBI · UNIVERSITY OF CALIFORNIA, SAN DIEGO · PI OHNO-MACHADO, LUCILA · 2010 to 2015
$19.1M
Phenotype Discovery in NHLBI Genomic Studies (PhD)UH2HL108785 · NHLBI · UNIVERSITY OF CALIFORNIA, SAN DIEGO · PI OHNO-MACHADO, LUCILA · 2011 to 2012
$1.1M
Protection of Records: Privacy (PReP) Technology for Medical ResearchR00LM011392 · NLM · UNIVERSITY OF CALIFORNIA, SAN DIEGO · PI JIANG, XIAOQIAN · 2013 to 2015
$650k
Phenotype Discovery in NHLBI Genomic Studies (PhD)UH3HL108785 · NHLBI · UNIVERSITY OF CALIFORNIA, SAN DIEGO · PI KIM, HYEON-EUI · 2013 to 2013
$500k
Protection of Records: Privacy (PReP) Technology for Medical ResearchK99LM011392 · NLM · UNIVERSITY OF CALIFORNIA, SAN DIEGO · PI JIANG, XIAOQIAN · 2012 to 2012
$76k
AHRQ HHS R01 HS019913AHRQ HHS R01HS019913NCATS NIH HHS UL1TR00010003NHLBI NIH HHS U54 HL108460NHLBI NIH HHS U54HL108460NHLBI NIH HHS UH2 HL108785NHLBI NIH HHS UH2HL108785NLM NIH HHS K99 LM011392NLM NIH HHS K99LM011392NLM NIH HHS R00 LM011392
6 · The paper itself

Abstract

Genome data are becoming increasingly important for modern medicine. As the rate of increase in DNA sequencing outstrips the rate of increase in disk storage capacity, the storage and data transferring of large genome data are becoming important concerns for biomedical researchers. We propose a two-pass lossless genome compression algorithm, which highlights the synthesis of complementary contextual models, to improve the compression performance. The proposed framework could handle genome compression with and without reference sequences, and demonstrated performance advantages over best existing algorithms. The method for reference-free compression led to bit rates of 1.720 and 1.838 bits per base for bacteria and yeast, which were approximately 3.7% and 2.6% better than the state-of-the-art algorithms. Regarding performance with reference, we tested on the first Korean personal genome sequence data set, and our proposed method demonstrated a 189-fold compression rate, reducing the raw file size from 2986.8 MB to 15.8 MB at a comparable decompression cost with existing algorithms. DNAcompact is freely available at https://sourceforge.net/projects/dnacompact/for research purpose.

Indexed as

AlgorithmsData CompressionDNAGenomeGenomicsModels, GeneticSoftwareDNA

Identifiers

PMID24282536
PMCPMC3840021
OpenAlexW2028990382

What OpenQuestion holds

Textmetadata
LicenceCC BY
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.