Evidence map›Paper›PMID 26182400›Full record

ArticlePloS one2015

Indexing Arbitrary-Length k-Mers in Sequencing Reads.

Tomasz Kowalski, Szymon Grabowski, Sebastian Deorowicz

Abstract read
In one paragraph

Article in PloS one, 2015. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 6 papers.

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

6 citing papers in PubMed.

  1. Article
  2. PgRC2: engineering the compression of sequencing reads.Bioinformatics (Oxford, England) · 2025
    Article
  3. Review
  4. Article
  5. SNPs detection by eBWT positional clustering.Algorithms for molecular biology : AMB · 2019
    Article
  6. 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

3 authors.

Tomasz KowalskiInstitute of Applied Computer Science, Lodz University of Technology, Al. Politechniki 11, 90-924 Łódź, Poland.
Szymon GrabowskiInstitute of Applied Computer Science, Lodz University of Technology, Al. Politechniki 11, 90-924 Łódź, Poland.
Sebastian DeorowiczInstitute of Informatics, Silesian University of Technology, Akademicka 16, 44-100 Gliwice, Poland.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

We propose a lightweight data structure for indexing and querying collections of NGS reads data in main memory. The data structure supports the interface proposed in the pioneering work by Philippe et al. for counting and locating k-mers in sequencing reads. Our solution, PgSA (pseudogenome suffix array), based on finding overlapping reads, is competitive to the existing algorithms in the space use, query times, or both. The main applications of our index include variant calling, error correction and analysis of reads from RNA-seq experiments.

Indexed as

AlgorithmsGenomeSoftwareAnimalsCaenorhabditis elegansDatasets as TopicEscherichia coliHigh-Throughput Nucleotide SequencingHumansSequence Analysis, RNA

Identifiers

PMID26182400
PMCPMC4504488

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.