Evidence map›Paper›PMID 25685176›Full record

ArticleAlgorithms for molecular biology : AMB2015

Estimating evolutionary distances between genomic sequences from spaced-word matches.

Burkhard Morgenstern, Bingyao Zhu, Sebastian Horwege, Chris André Leimeister

Abstract read
In one paragraph

Article in Algorithms for molecular biology : AMB, 2015. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 28 papers.

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

28 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. EvANI benchmarking workflow for evolutionary distance estimation.bioRxiv : the preprint server for biology · 2025
    Article
  6. A k-mer-Based Estimator of the Substitution Rate Between Repetitive Sequences.Algorithms in bioinformatics : ... International Workshop, WABI ..., proceedings. WABI (Workshop) · 2025
    Article
  7. A survey of k-mer methods and applications in bioinformatics.Computational and structural biotechnology journal · 2024
    Review
  8. The Statistics of Parametrized Syncmers in a Simple Mutation Process Without Spurious Matches.Journal of computational biology : a journal of computational molecular cell biology · 2024
    Article
  9. How to optimally sample a sequence for rapid analysis.Bioinformatics (Oxford, England) · 2023
    Article
  10. Article
  11. The Statistics ofJournal of computational biology : a journal of computational molecular cell biology · 2022
    Article
  12. Article
  13. Article
  14. Article
  15. Article
  16. Article
  17. Article
  18. Long-read amplicon denoising.Nucleic acids research · 2019
    Article
  19. Article
  20. Article
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

4 authors.

Burkhard MorgensternUniversity of Göttingen, Department of Bioinformatics, Goldschmidtstr. 1, Göttingen, 37073 Germany ; Université d'Evry Val d'Essonne, Laboratoire Statistique et Génome, UMR CNRS 8071, USC INRA 23 Boulevard de France, Evry, 91037 France.
Bingyao ZhuUniversity of Göttingen, Department of General Microbiology, Grisebachstr. 8, Göttingen, 37073 Germany.
Sebastian HorwegeUniversity of Göttingen, Department of Bioinformatics, Goldschmidtstr. 1, Göttingen, 37073 Germany.
Chris André LeimeisterUniversity of Göttingen, Department of Bioinformatics, Goldschmidtstr. 1, Göttingen, 37073 Germany.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Alignment-free methods are increasingly used to calculate evolutionary distances between DNA and protein sequences as a basis of phylogeny reconstruction. Most of these methods, however, use heuristic distance functions that are not based on any explicit model of molecular evolution. Herein, we propose a simple estimator d N of the evolutionary distance between two DNA sequences that is calculated from the number N of (spaced) word matches between them. We show that this distance function is more accurate than other distance measures that are used by alignment-free methods. In addition, we calculate the variance of the normalized number N of (spaced) word matches. We show that the variance of N is smaller for spaced words than for contiguous words, and that the variance is further reduced if our spaced-words approach is used with multiple patterns of 'match positions' and 'don't care positions'. Our software is available online and as downloadable source code at: http://spaced.gobics.de/.

Indexed as

Alignment-freeDistance estimationGenome comparisonk-mersPhylogenySpaced wordsVarianceWord frequency

Identifiers

PMID25685176
PMCPMC4327811

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