Evidence map›Paper›PMID 38036969›Full record

ArticleBMC bioinformatics2023

PMFFRC: a large-scale genomic short reads compression optimizer via memory modeling and redundant clustering.

Hui Sun, Yingfeng Zheng, Haonan Xie, Huidong Ma, Xiaoguang Liu, Gang Wang

Abstract read
In one paragraph

Article in BMC bioinformatics, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers.

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

2 citing papers in PubMed.

  1. Article
  2. 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.

Hui SunNankai-Baidu Joint Laboratory, College of Computer Science, Nankai University, Tianjin, China.
Yingfeng ZhengNankai-Baidu Joint Laboratory, College of Computer Science, Nankai University, Tianjin, China.
Haonan XieInstitute of Artificial Intelligence, School of Electrical Engineering, Guangxi University, Nanning, China.
Huidong MaNankai-Baidu Joint Laboratory, College of Computer Science, Nankai University, Tianjin, China.
Xiaoguang LiuNankai-Baidu Joint Laboratory, College of Computer Science, Nankai University, Tianjin, China. liuxg@nbjl.nankai.edu.cn.
Gang WangNankai-Baidu Joint Laboratory, College of Computer Science, Nankai University, Tianjin, China. adairmillersh@gmail.com.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundGenomic sequencing reads compressors are essential for balancing high-throughput sequencing short reads generation speed, large-scale genomic data sharing, and infrastructure storage expenditure. However, most existing short reads compressors rarely utilize big-memory systems and duplicative information between diverse sequencing files to achieve a higher compression ratio for conserving reads data storage space.

resultsWe employ compression ratio as the optimization objective and propose a large-scale genomic sequencing short reads data compression optimizer, named PMFFRC, through novelty memory modeling and redundant reads clustering technologies. By cascading PMFFRC, in 982 GB fastq format sequencing data, with 274 GB and 3.3 billion short reads, the state-of-the-art and reference-free compressors HARC, SPRING, Mstcom, and FastqCLS achieve 77.89%, 77.56%, 73.51%, and 29.36% average maximum compression ratio gains, respectively. PMFFRC saves 39.41%, 41.62%, 40.99%, and 20.19% of storage space sizes compared with the four unoptimized compressors.

conclusionsPMFFRC rational usage big-memory of compression server, effectively saving the sequencing reads data storage space sizes, which relieves the basic storage facilities costs and community sharing transmitting overhead. Our work furnishes a novel solution for improving sequencing reads compression and saving storage space. The proposed PMFFRC algorithm is packaged in a same-name Linux toolkit, available un-limited at https://github.com/fahaihi/PMFFRC .

Indexed as

Data CompressionAlgorithmsCluster AnalysisGenomicsHigh-Throughput Nucleotide SequencingSequence Analysis, DNASoftwareData compressionFastqParallel algorithmShort reads data

Identifiers

PMID38036969
PMCPMC10691058

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.