Evidence map›Paper›PMID 26093148›Full record

ArticleBioinformatics (Oxford, England)2015

LFQC: a lossless compression algorithm for FASTQ files.

Marius Nicolae, Sudipta Pathak, Sanguthevar Rajasekaran

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 20 papers.

0numbers the graph read from it
0cells of the map it votes in
20citing papers in PubMed
–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

20 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Review
  6. Article
  7. CoLoRd: compressing long reads.Nature methods · 2022
    Article
  8. Article
  9. Article
  10. Article
  11. Tackling the Challenges of FASTQ Referential Compression.Bioinformatics and biology insights · 2019
    Article
  12. Article
  13. MZPAQ: a FASTQ data compression tool.Source code for biology and medicine · 2019
    Article
  14. Article
  15. Article
  16. Article
  17. Article
  18. Article
  19. Single-cell Transcriptome Study as Big Data.Genomics, proteomics & bioinformatics · 2016
    Review
  20. 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.

Marius NicolaeDepartment of Computer Science and Engineering, University of Connecticut, Storrs, CT 06269-4155, USA.
Sudipta PathakDepartment of Computer Science and Engineering, University of Connecticut, Storrs, CT 06269-4155, USA.
Sanguthevar RajasekaranDepartment of Computer Science and Engineering, University of Connecticut, Storrs, CT 06269-4155, USA.

Funding

Efficient Algorithms for Motif SearchR01LM010101 · NLM · UNIVERSITY OF CONNECTICUT STORRS · PI RAJASEKARAN, SANGUTHEVAR · 2010 to 2013
$1.4M
NLM NIH HHS R01-LM010101
6 · The paper itself

Abstract

motivationNext Generation Sequencing (NGS) technologies have revolutionized genomic research by reducing the cost of whole genome sequencing. One of the biggest challenges posed by modern sequencing technology is economic storage of NGS data. Storing raw data is infeasible because of its enormous size and high redundancy. In this article, we address the problem of storage and transmission of large FASTQ files using innovative compression techniques.

resultsWe introduce a new lossless non-reference based FASTQ compression algorithm named Lossless FASTQ Compressor. We have compared our algorithm with other state of the art big data compression algorithms namely gzip, bzip2, fastqz (Bonfield and Mahoney, 2013), fqzcomp (Bonfield and Mahoney, 2013), Quip (Jones et al., 2012), DSRC2 (Roguski and Deorowicz, 2014). This comparison reveals that our algorithm achieves better compression ratios on LS454 and SOLiD datasets. AVAILABILITY AND IMPLEMENTATION: The implementations are freely available for non-commercial purposes. They can be downloaded from http://engr.uconn.edu/rajasek/lfqc-v1.1.zip. CONTACT: rajasek@engr.uconn.edu.

Indexed as

AlgorithmsData CompressionGenomicsHigh-Throughput Nucleotide SequencingInformation Storage and RetrievalSequence Analysis, DNA

Identifiers

PMID26093148
PMCPMC4795634

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.