Evidence map›Paper›PMID 25710001›Full record

ReviewFrontiers in bioengineering and biotechnology2015

Searching and Indexing Genomic Databases via Kernelization.

Travis Gagie, Simon J Puglisi

Abstract readReview
In one paragraph

Review in Frontiers in bioengineering and biotechnology, 2015. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 9 papers.

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

9 citing papers in PubMed.

  1. Article
  2. Taxonomic classification with maximal exact matches in KATKA kernels and minimizer digests.LIPIcs : Leibniz international proceedings in informatics · 2024
    Article
  3. Article
  4. Article
  5. Efficient Construction of a Complete Index for Pan-Genomics Read Alignment.Journal of computational biology : a journal of computational molecular cell biology · 2020
    Article
  6. Article
  7. Article
  8. Relative Suffix Trees.The computer journal · 2018
    Article
  9. Review
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.

Travis GagieHelsinki Institute for Information Technology (HIIT) and Department of Computer Science, University of Helsinki , Helsinki , Finland.
Simon J PuglisiHelsinki Institute for Information Technology (HIIT) and Department of Computer Science, University of Helsinki , Helsinki , Finland.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The rapid advance of DNA sequencing technologies has yielded databases of thousands of genomes. To search and index these databases effectively, it is important that we take advantage of the similarity between those genomes. Several authors have recently suggested searching or indexing only one reference genome and the parts of the other genomes where they differ. In this paper, we survey the 20-year history of this idea and discuss its relation to kernelization in parameterized complexity.

Indexed as

approximate pattern matchingdata compressiongenomic databasesindexingkernelizationrandom-access readingstring algorithms

Identifiers

PMID25710001
PMCPMC4321636

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.