Evidence map›Paper›PMID 25393923›Full record

ArticleJournal of computational biology : a journal of computational molecular cell biology2014

A coverage criterion for spaced seeds and its applications to support vector machine string kernels and k-mer distances.

Laurent Noé, Donald E K Martin

Abstract read
In one paragraph

Article in Journal of computational biology : a journal of computational molecular cell biology, 2014. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 10 papers.

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

10 citing papers in PubMed.

  1. Article
  2. How to optimally sample a sequence for rapid analysis.Bioinformatics (Oxford, England) · 2023
    Article
  3. Article
  4. Mismatch-tolerant, alignment-free sequence classification using multiple spaced seeds and multiindex Bloom filters.Proceedings of the National Academy of Sciences of the United States of America · 2020
    Article
  5. Article
  6. Review
  7. Article
  8. Article
  9. Article
  10. 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

2 authors.

Laurent Noé1 Laboratoire d'Informatique Fondamentale de Lille (LIFL) (UMR 8022 Lille 1/CNRS) - Inria Lille, Villeneuve d'Ascq, France .
Donald E K Martin

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Spaced seeds have been recently shown to not only detect more alignments, but also to give a more accurate measure of phylogenetic distances, and to provide a lower misclassification rate when used with Support Vector Machines (SVMs). We confirm by independent experiments these two results, and propose in this article to use a coverage criterion to measure the seed efficiency in both cases in order to design better seed patterns. We show first how this coverage criterion can be directly measured by a full automaton-based approach. We then illustrate how this criterion performs when compared with two other criteria frequently used, namely the single-hit and multiple-hit criteria, through correlation coefficients with the correct classification/the true distance. At the end, for alignment-free distances, we propose an extension by adopting the coverage criterion, show how it performs, and indicate how it can be efficiently computed.

Indexed as

Pattern Recognition, AutomatedSequence AlignmentSupport Vector MachineAlgorithmsHumansSequence Analysis, ProteinSequence Homology, Amino AcidSoftwarealignment-free distancecoveragespaced seedssupport vector machine

Identifiers

PMID25393923
PMCPMC4253314

What OpenQuestion holds

Textmetadata
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.