Evidence map›Paper›PMID 42219617›Full record

ArticleG3 (Bethesda, Md.)2026

diempy: fast and reference-free genome polarization and chromosome painting.

Derek Setter, Konrad Lohse, Stuart J E Baird

Abstract read
In one paragraph

Article in G3 (Bethesda, Md.), 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

3 authors.

Derek SetterInstitute of Ecology and Evolution, University of Edinburgh, Edinburgh EH9 3DW, United Kingdom.
Konrad LohseInstitute of Ecology and Evolution, University of Edinburgh, Edinburgh EH9 3DW, United Kingdom.ORCID 0000-0001-9918-058X
Stuart J E BairdInstitute of Vertebrate Biology, Czech Academy of Sciences, Brno 603 65, Czechia.ORCID 0000-0002-7144-9919

Funding

Czech Science Foundation 22-32394sEPSRC EP/X022595/1
6 · The paper itself

Abstract

Most ancestry inference methods rely on putatively pure reference panels to define ancestry informative variants. This approach is often unrealistic and can bias inference. The genome polarization algorithm diem, introduced previously by Baird et al., avoids reference panels by jointly inferring the polarity of common allelic states and quantifying variant diagnosticity via an expectation-maximization procedure. Importantly, we use "polarization" strictly to mean the assignment of alleles to opposing sides of a barrier to gene flow, rather than the assignment of ancestral versus derived states. Here, we present diempy, an efficient python implementation of diem coupled with tools that turn polarized calls into analysis-ready outputs. diempy offers lossless VCF-to-diem BED conversion; ploidy-aware handling of individuals and chromosomes; flexible masking of sites, regions, and individuals; and interactive visualization of polarized genomes, hybrid indices, clines, and ternary plots. Postprocessing functions include thresholding via the diagnostic index, kernel smoothing, and automatic detection and run-length encoding of contiguous ancestry tracts. BED-based I/O facilitates integration with population-genomic workflows (e.g. filtering by annotation or ploidy). These features make reference-panel-free genome polarization with diempy practical and reproducible for studies of population structure, admixture and species barriers.

Indexed as

Chromosome PaintingGenomeGenomicsSoftwareAlgorithmsHumansadmixturechromosome paintinggenetic barriersgenome polarizationpopulation genomicsreference-free

Identifiers

PMID42219617
PMCPMC13439930

What Socratic 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 Socratic graph.