Starcode: sequence clustering based on all-pairs search
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
Motivation: The 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. Results: Here, 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. Contact: guillaume.filion@gmail.com
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Needleman, S. B., & Wunsch, C. D. (1970) · Journal of Molecular Biology · doi:10.1016/0022-2836(70)90057-4 · Cited by 11,288 · cited 2×
“The matching method of starcode is based on a variation of the Needleman–Wunsch (NW) algorithm (Needleman and Wunsch, 1970).”
Cd-hit: Accelerated for clustering the next-generation sequencing data
Fu, L., Niu, B., Zhu, Z., Wu, S., & Li, W. (2012) · Bioinformatics · doi:10.1093/bioinformatics/bts565 · Cited by 11,175
Genome sequencing in microfabricated high-density picolitre reactors
Margulies, M., Egholm, M., Altman, W. E., Attiya, S., Bader, J. S., Bemben, L. A., Berka, J., Braverman, M. S., Chen, Y.-J., Chen, Z., et al. (2005) · Nature · doi:10.1038/nature03959 · Cited by 7,693
Real-Time DNA Sequencing from Single Polymerase Molecules
Eid, J., Fehr, A., Gray, J., Luong, K., Lyle, J., Otto, G., Peluso, P., Rank, D., Baybayan, P., Bettman, B., et al. (2009) · Science · doi:10.1126/science.1162986 · Cited by 3,732
Substantial biases in ultra-short read data sets from high-throughput DNA sequencing
Dohm, J. C., Lottaz, C., Borodina, T., & Himmelbauer, H. (2008) · Nucleic Acids Research · doi:10.1093/nar/gkn425 · Cited by 1,088 · cited 1×
“For instance, the Illumina platform (Margulies et al. , 2005) has a 1–2% error rate consisting of substitutions (Dohm et al. , 2008; Nakamura et al. , 2011) and the PacBio platform has a 15% error rate consisting of insertions and deletions (Eid et al. , 2009).”
Method
Cited by
Single-cell profiling of the developing mouse brain and spinal cord with split-pool barcoding
Rosenberg, A. B., Roco, C. M., Muscat, R. A., Kuchina, A., Sample, P., Yao, Z., Graybuck, L. T., Peeler, D. J., Mukherjee, S., Chen, W., et al. (2018) · Science · doi:10.1126/science.aam8999 · Cited by 1,422
Kurppa, K. J., Liu, Y., To, C., Zhang, T., Fan, M., Vajdi, A., Knelson, E. H., Xie, Y., Lim, K., Cejas, P., et al. (2020) · Cancer Cell · doi:10.1016/j.ccell.2019.12.006 · Cited by 475
Single-cell mapping of lineage and identity in direct reprogramming
Biddy, B. A., Kong, W., Kamimoto, K., Guo, C., Waye, S. E., Sun, T., & Morris, S. A. (2018) · Nature · doi:10.1038/s41586-018-0744-4 · Cited by 392
Barcoded viral tracing of single-cell interactions in central nervous system inflammation
Clark, I. C., Gutiérrez-Vázquez, C., Wheeler, M. A., Li, Z., Rothhammer, V., Linnerbauer, M., Sanmarco, L. M., Guo, L., Blain, M., Zandee, S. E. J., et al. (2021) · Science · doi:10.1126/science.abf1230 · Cited by 285
Genome-wide target specificities of CRISPR-Cas9 nucleases revealed by multiplex Digenome-seq
Kim, D., Kim, S., Kim, S., Park, J., & Kim, J.-S. (2016) · Genome Research · doi:10.1101/gr.199588.115 · Cited by 208
“The resulting multiplex Digenome-captured sites were classified into 11 groups by edit distance (Zorita et al. 2015).”
Method
Metadata
- Authors
- Zorita, E., Cuscó, P., & Filion, G. J.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2015-01-31
- Volume
- 31
- Issue
- 12
- Pages
- 1913-1919
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2116699248
- Cited by
- 240
- References
- 5
- FWCI
- 10.64
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.