Evidence map›Paper›PMID 42239247›Full record

ArticlebioRxiv : the preprint server for biology2026

Min-frame transformation enables more sensitive viral genome alignment.

Ryan D Doughty, Ankhi Banerjee, Bryce Kille, Tandy Warnow, Todd J Treangen

Abstract readPreprint
In one paragraph

Article in bioRxiv : the preprint server for biology, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

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

0 citing papers in PubMed.

No citing paper in PubMed yet.

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

5 authors.

Ryan D DoughtyDepartment of Computer Science, Rice University, Houston, TX, USA.ORCID 0009-0001-8355-0926
Ankhi BanerjeeDepartment of Computer Science, Rice University, Houston, TX, USA.ORCID 0009-0002-0713-4071
Bryce KilleDepartment of Computer Science, Rice University, Houston, TX, USA.ORCID 0000-0003-2946-6915
Tandy WarnowSiebel School of Computing and Data Science, University of Illinois Urbana-Champaign, Urbana, IL, USA.ORCID 0000-0001-7717-3514
Todd J TreangenDepartment of Computer Science, Rice University, Houston, TX, USA; Department of Bioengineering, Rice University, Houston, TX, USA; Ken Kennedy Institute, Rice University, Houston, TX, USA.ORCID 0000-0002-3760-564X

Funding

Viral Diversity and Pathogenicity in Mucosal Respiratory and Gastrointestinal DiseaseU19AI144297 · NIAID · BAYLOR COLLEGE OF MEDICINE · PI ESTES, MARY KOLB, GIBBS, RICHARD A · 2019 to 2024
$30.1M
TRAINING PROGRAM IN COMPUTATIONAL BIOLOGY AND MEDICINET15LM007093 · NLM · RICE UNIVERSITY · PI Lydia E. Kavraki · 1992 to 2026
$20.8M
Project 3: Functional Microbiome and Host Signatures in Transition from Commensal to pathogenP01AI152999 · NIAID · UNIVERSITY OF TEXAS HLTH SCI CTR HOUSTON · PI ARIAS, CESAR AUGUSTO, SAVIDGE, TOR C. · 2020 to 2025
$12.0M
NIAID NIH HHS P01 AI152999NIAID NIH HHS U19 AI144297NLM NIH HHS T15 LM007093
6 · The paper itself

Abstract

Motivation: Maximal unique matches (MUMs) are a fundamental primitive in genome comparison, where they serve as high-confidence anchors for downstream multiple genome alignment. However, because MUMs rely on exact string matching, their effectiveness degrades with increased genome divergence and larger sets of genomes, inhibiting their ability to recover long homologous regions and reducing the number of base pairs covered by the multiple genome alignment. Additionally, existing approaches that improve robustness to mutation, such as spaced seeds or translated alignment methods, introduce trade-offs in specificity, scalability, or computational complexity. Methods: To address this gap, we introduce the Min-Frame Transformation (MFT), a deterministic encoding of nucleotide sequences to sequences over a transformed alphabet that preserves the coordinate structure of the original sequence. At each position, the MFT selects a Impact: The MFT is a novel computational approach for improving the robustness of MUM-based seeding for genome alignment by producing longer and more contiguous matches that span a greater fraction of the genome, leading to improved alignment coverage and SNP recall. Altogether, these improvements have the potential to result in improvements for downstream viral genome analysis applications such as phylogenetic inference and transmission analysis.

Indexed as

Applied computing → Computational genomicsMaximal Unique MatchesMultiple Genome AlignmentViruses

Identifiers

PMID42239247
PMCPMC13228574

What OpenQuestion holds

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