ArticleAlgorithms for molecular biology : AMB2017
Phylogeny reconstruction based on the length distribution of
Article in Algorithms for molecular biology : AMB, 2017. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 7 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
7 citing papers in PubMed.
- Insertions and deletions as phylogenetic signal in an alignment-free context.PLoS computational biology · 2022Article
- 'Multi-SpaM': a maximum-likelihood approach to phylogeny reconstruction using multiple spaced-word matches and quartet trees.NAR genomics and bioinformatics · 2020Article
- The number of k-mer matches between two DNA sequences as a function of k and applications to estimate phylogenetic distances.PloS one · 2020Article
- Read-SpaM: assembly-free and alignment-free comparison of bacterial genomes with low sequencing coverage.BMC bioinformatics · 2019Article
- Prot-SpaM: fast alignment-free phylogeny reconstruction based on whole-proteome sequences.GigaScience · 2019Article
- Skmer: assembly-free and alignment-free sample identification using genome skims.Genome biology · 2019Article
- Phylogenetics beyond biology.Theory in biosciences = Theorie in den Biowissenschaften · 2018Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
backgroundVarious approaches to alignment-free sequence comparison are based on the length of exact or inexact word matches between pairs of input sequences. Haubold et al. (J Comput Biol 16:1487-1500, 2009) showed how the average number of substitutions per position between two DNA sequences can be estimated based on the average length of exact common substrings.
resultsIn this paper, we study the length distribution of
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.