ArticleBMC bioinformatics2025
The application of compressed sensing on tumor mutation burden calculation from overlapped pooling sequencing data.
Article in BMC bioinformatics, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
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.
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.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
5 authors.
Funding
Abstract
backgroundTumor Mutation Burden (TMB) is commonly characterized as the number of non-synonymous somatic SNVs per megabase within the gene region identified through whole exon sequencing or targeted sequencing in a tumor sample. It has been statistically demonstrated that TMB was related to the ability of neoantigen production and used to predict the efficacy of immunotherapy for various types of cancers. However, screening for TMB in patients poses challenges due to the extensive labor and financial resources required for the preparation of large quantities of parallel sequencing libraries.
resultsIn this study, we employed compressed sensing (CS) to calculate TMB from overlapped pooling sequencing data, aiming to reduce the sequencing cost by minimizing the number of library builds. Over 90% SNPs could still be detected without a significant loss of mutation information even when the data is pooled from ten different samples. Based on this, the orthogonal matching pursuit (OMP) algorithm and the basic pursuit (BP) algorithm were used to reconstruct TMB from pooling sequencing data. The performance of these two algorithms was evaluated. The BP algorithm consistently performed well across all cases, albeit necessitating extended computational time. The OMP algorithm has been proved to be suitable for scenarios where the original matrix was sparse but it showed low overall performance. Based on an accurate calculation of TMB, we determined that the number of sequencing runs could be reduced to 0.6 times the total number of samples, resulting in a 40% reduction in sequencing cost.
conclusionsIn conclusion, we calculated TMB from overlapped pooling sequencing data utilizing compressed sensing strategy to reduce sequencing cost. Our findings confirm that the SNP calling from ten samples' pooling sequencing data is feasible. Additionally, we performed an assessment of the reconstruction efficiency of both the BP model and the OMP model.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
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.