Evidence map›Paper›PMID 25638815›Full record

ArticleBioinformatics (Oxford, England)2015

Starcode: sequence clustering based on all-pairs search.

Eduard Zorita, Pol Cuscó, Guillaume J Filion

Abstract read
In one paragraph

Article in Bioinformatics (Oxford, England), 2015. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 127 papers.

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

127 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. BCAR: a fast and indel-tolerant barcode-sequence mapper.Bioinformatics (Oxford, England) · 2026
    Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Article
  10. Article
  11. Article
  12. Article
  13. Article
  14. Article
  15. Multiplexed enrichment and tracking of lineages with CloneSweeper.bioRxiv : the preprint server for biology · 2026
    Article
  16. Article
  17. Article
  18. Article
  19. Article
  20. Article

67 more citing papers are in PubMed but not listed here.

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.

Eduard ZoritaGenome Architecture, Gene Regulation, Stem Cells and Cancer Programme, Centre for Genomic Regulation (CRG), Dr. Aiguader 88, 08003 Barcelona and Universitat Pompeu Fabra (UPF), 08002 Barcelona, Spain Genome Architecture, Gene Regulation, Stem Cells and Cancer Programme, Centre for Genomic Regulation (CRG), Dr. Aiguader 88, 08003 Barcelona and Universitat Pompeu Fabra (UPF), 08002 Barcelona, Spain.
Pol CuscóGenome Architecture, Gene Regulation, Stem Cells and Cancer Programme, Centre for Genomic Regulation (CRG), Dr. Aiguader 88, 08003 Barcelona and Universitat Pompeu Fabra (UPF), 08002 Barcelona, Spain Genome Architecture, Gene Regulation, Stem Cells and Cancer Programme, Centre for Genomic Regulation (CRG), Dr. Aiguader 88, 08003 Barcelona and Universitat Pompeu Fabra (UPF), 08002 Barcelona, Spain.
Guillaume J FilionGenome Architecture, Gene Regulation, Stem Cells and Cancer Programme, Centre for Genomic Regulation (CRG), Dr. Aiguader 88, 08003 Barcelona and Universitat Pompeu Fabra (UPF), 08002 Barcelona, Spain Genome Architecture, Gene Regulation, Stem Cells and Cancer Programme, Centre for Genomic Regulation (CRG), Dr. Aiguader 88, 08003 Barcelona and Universitat Pompeu Fabra (UPF), 08002 Barcelona, Spain.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

motivationThe increasing throughput of sequencing technologies offers new applications and challenges for computational biology. In many of those applications, sequencing errors need to be corrected. This is particularly important when sequencing reads from an unknown reference such as random DNA barcodes. In this case, error correction can be done by performing a pairwise comparison of all the barcodes, which is a computationally complex problem.

resultsHere, we address this challenge and describe an exact algorithm to determine which pairs of sequences lie within a given Levenshtein distance. For error correction or redundancy reduction purposes, matched pairs are then merged into clusters of similar sequences. The efficiency of starcode is attributable to the poucet search, a novel implementation of the Needleman-Wunsch algorithm performed on the nodes of a trie. On the task of matching random barcodes, starcode outperforms sequence clustering algorithms in both speed and precision. AVAILABILITY AND IMPLEMENTATION: The C source code is available at http://github.com/gui11aume/starcode.

Indexed as

AlgorithmsCluster AnalysisSoftwareComputational BiologyHigh-Throughput Nucleotide SequencingHumansSequence Analysis, DNA

Identifiers

PMID25638815
PMCPMC4765884

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC
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.