ArticleAlgorithms for molecular biology : AMB2017
Best hits of 11110110111: model-free selection and parameter-free sensitivity calculation of spaced seeds.
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 9 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
9 citing papers in PubMed, 23 citations in OpenAlex.
- Hash functions in nucleotide sequence analysis.Genome research · 2026Review
- Taming large-scale genomic analyses via sparsified genomics.Nature communications · 2025Article
- Identification of isolated or mixed strains from long reads: a challenge met onMicrobial genomics · 2021Article
- '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
- Prot-SpaM: fast alignment-free phylogeny reconstruction based on whole-proteome sequences.GigaScience · 2019Article
- Accurate multiple alignment of distantly related genome sequences using filtered spaced word matches as anchor points.Bioinformatics (Oxford, England) · 2019Article
- Efficient computation of spaced seed hashing with block indexing.BMC bioinformatics · 2018Article
- Phylogeny reconstruction based on the length distribution ofAlgorithms for molecular biology : AMB · 2017Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
1 author at 1 institution in 1 country.
Funding
No grant is acknowledged in the PubMed record.
Abstract
background
resultsWe expand the scope of work of Mak and Benson on single and multiple seeds by considering the Hit Integration model of Chung and Park (BMC Bioinform 11:31, 2010), demonstrate that the same dominance definition can be applied, and that a parameter-free study can be performed without any significant additional cost. We also consider two new discrete models, namely the Heaviside and the Dirac models, where lossless seeds can be integrated. From a theoretical standpoint, we establish a generic framework on all the proposed models, by applying a
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.