SuperFreq: Integrated mutation detection and clonal tracking in cancer

Flensburg, C.; Sargeant, T.; Oshlack, A.; Majewski, I.

doi:10.1101/380097

Home/Archive/bioRxiv

bioRxiv · 10.1101/380097

SuperFreq: Integrated mutation detection and clonal tracking in cancer

Flensburg, C.·Sargeant, T.·Oshlack, A.·Majewski, I.

View original source ↗Export metadata ↓

Abstract

Analysing multiple cancer samples from an individual patient can provide insight into the way the disease evolves. Monitoring the expansion and contraction of distinct clones helps to reveal the mutations that initiate the disease and those that drive progression. Existing approaches for clonal tracking from sequencing data typically require the user to combine multiple tools that are not purpose-built for this task. Furthermore, most methods require a matched normal (non-tumour) sample, which limits the scope of application. We developed SuperFreq, a cancer exome sequencing analysis pipeline that integrates identification of somatic single nucleotide variants (SNVs) and copy number alterations (CNAs) and clonal tracking for both. SuperFreq does not require a matched normal and instead relies on unrelated controls. When analysing multiple samples from a single patient, SuperFreq cross checks variant calls to improve clonal tracking, which helps to separate somatic from germline variants, and to resolve overlapping CNA calls. To demonstrate our software we analysed 304 cancer-normal exome samples across 33 cancer types in The Cancer Genome Atlas (TCGA) and evaluated the quality of the SNV and CNA calls. We simulated clonal evolution through in silico mixing of cancer and normal samples in known proportion. We found that SuperFreq identified 93% of clones with a cellular fraction of at least 50% and mutations were assigned to the correct clone with high recall and precision. In addition, SuperFreq maintained a similar level of performance for most aspects of the analysis when run without a matched normal. SuperFreq is highly versatile and can be applied in many different experimental settings for the analysis of exomes and other capture libraries. We demonstrate an application of SuperFreq to leukaemia patients with diagnosis and relapse samples. SuperFreq is implemented in R and available on github at https://github.com/ChristofferFlensburg/SuperFreq.

Source connections

Published article ↗

Explore related subjects

bioinformatics Preprint

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Flensburg, C., Sargeant, T., Oshlack, A., Majewski, I.. 2018-07-30. SuperFreq: Integrated mutation detection and clonal tracking in cancer. https://doi.org/10.1101/380097

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related preprints

bioRxiv2026

Transcript quantification using context-aware MAPQ modeling

Long-read RNA-sequencing enables accurate transcript-level quantification, but prior static filtering of MAPping Quality (MAPQ) can ignore transcriptome-intrinsic ambiguity, and discarding reads on this basis distorts abundance estimates. We present CALMeR (Context-Aware Long-read MAPQ-based Rescuer), which conditions MAPQ filtering on transcript properties rather than a fixed cutoff. CALMeR fits a zero-one inflated beta regression on various transcript and read-level features to model the expected MAPQ distribution for each alignment. Reads whose MAPQ fits this context, such as low-MAPQ reads from multi-isoform genes and paralog families are retained; reads with anomalously low MAPQ are removed as likely artifacts. Retained reads can be summed per transcript or passed to any downstream quantifier. Compared with a MAPQ [≥] 1 filter and expectation-maximization-based transcript quantification methods, CALMeR recovers more spike-in transcripts and better matches known spike-in concentrations. CALMeR is available at https://github.com/sparthib/CALMeR.

bioinformatics↗

bioRxiv2026

Structure-resolved fold annotation of the medicinal-leech salivary-EV cargo: a Ly-6/uPAR three-finger scaffold and a structurally dark fraction

Many proteins that medicinal leeches package into salivary extracellular vesicles (EVs) carry no interpretable sequence annotation, so the least-characterised part of a pharmacologically important secretome lacks even a fold assignment. A companion Astral-DIA study of Hirudinaria manillensis nominated 17 ultra-enriched candidate EV cargo proteins. Here we ask whether structure prediction and structural search can assign folds where sequence methods fail, and which candidates remain unresolved under prespecified criteria. With an offline pipeline (ESMFold, TM-align, Foldseek against AFDB-SwissProt and PDB100, UniRef90 search, protein-to-genome alignment), the candidates separate into intracellular/membrane machinery and a secreted, cysteine-dense fraction of three proteins with no Pfam domain. The predicted structure of the leech Protein-sleepless homolog g21166 supports its assignment to the Ly-6/uPAR three-finger fold (TM 0.58 vs CD59; best significant PDB match Lynx1); no function is inferred. g436 and g20791 returned no match meeting the criterion (alnTM [≥] 0.5, E [≤] 0.05) in either database, g436 even after homolog-informed modelling. Gene structure and splice junctions support a conserved locus for the two-Trypsin-segment model g8114 (catalytic unit not established). A Boltz-2 thrombin pilot did not support target engagement, and a pre-registered nicotinic test was terminated as undecidable. The results yield a structure-informed shortlist for experimental follow-up.

bioinformatics↗

bioRxiv2026

EpiRank: partner-agnostic surface-patch retrieval for epitope prediction of protein binding interfaces

Structure-based interface predictors are normally reported as a single pooled ROC AUC over a residue test set. For a protein designer the operative question is different and much harder: given one target chain, will the top-ranked surface patch be a real binding site? We built EpiRank, a partner-agnostic epitope predictor, on HumanPPI 29,246 predicted human dimers, 12,296 target chains, 4.18 M residues using only single-chain geometry and physicochemistry (170 features, no partner, no sequence search, no structural alphabet), and evaluated it as a retrieval problem with homology- and partner-graph-controlled splits, on the 3,529 chains that survive an explicit partner-contamination filter. The model places a real epitope in its top-ranked patch 64 % of the time. That number is far less informative than it looks. Compact patches placed at random hit a real epitope 41 % of the time under the same rule, so the model's lift is 1.57 x, not 64 %; 54 % of all predicted patches land on nothing; and when the same chains are scored by models trained on a 2,000-chain and an 11,669-chain superset, a substantial fraction change answer while the aggregate barely moves. We document four specific ways this task invites overstatement partner-graph percolation across splits, single-linkage homology percolation at the conventional 30 % identity threshold, a count-only hit rule that rewards spatial smoothing rather than signal, and hotspot precision conditioned on success, which ranks a random baseline above the trained model. Each was hit during development and each inverted a conclusion we had already drawn. We argue that interface-prediction papers should report lift over a geometry-matched random baseline, patch precision, and per-target stability alongside AUC, and we release the evaluation harness that computes them.

bioinformatics↗