ArticleBioinformatics (Oxford, England)2026
Finding low-complexity DNA sequences with longdust.
Article in Bioinformatics (Oxford, England), 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 4 papers.
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
4 citing papers in PubMed.
- AniAnn's: alignment-free annotation of tandem repeat arrays using fast average nucleotide identity estimates.Bioinformatics (Oxford, England) · 2026Article
- Genomic comparison of clinical strains ofMicrobial genomics · 2026Article
- Gene conversion is a key driver of diversity hotspots inbioRxiv : the preprint server for biology · 2026Article
- Challenges in structural variant calling in low-complexity regions.GigaScience · 2025Article
Corrections and comments
- Update of
Authors and funding
2 authors.
Funding
Abstract
motivationLow-complexity (LC) DNA sequences are compositionally repetitive sequences that are often associated with spurious homologous matches and variant calling artifacts. While algorithms for identifying LC sequences exist, they either lack concise mathematical definition of complexity or are inefficient with long or variable context windows.
resultsLongdust is a new algorithm that efficiently identifies long LC sequences including centromeric satellite and tandem repeats with moderately long motifs. It defines string complexity by statistically modeling the k-mer count distribution with the parameters: the k-mer length, the context window size and a threshold on complexity. Longdust exhibits high performance on real data and high consistency with existing methods. AVAILABILITY AND IMPLEMENTATION: https://github.com/lh3/longdust.
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.