Sparc: a sparsity-based consensus algorithm for long erroneous sequencing reads
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 third generation sequencing (3GS) technology generates long sequences of thousands of bases. However, its current error rates are estimated in the range of 15–40%, significantly higher than those of the prevalent next generation sequencing (NGS) technologies (less than 1%). Fundamental bioinformatics tasks such as de novo genome assembly and variant calling require high-quality sequences that need to be extracted from these long but erroneous 3GS sequences. Results. We describe a versatile and efficient linear complexity consensus algorithm Sparc to facilitate de novo genome assembly. Sparc builds a sparse k-mer graph using a collection of sequences from a targeted genomic region. The heaviest path which approximates the most likely genome sequence is searched through a sparsity-induced reweighted graph as the consensus sequence. Sparc supports using NGS and 3GS data together, which leads to significant improvements in both cost efficiency and computational efficiency. Experiments with Sparc show that our algorithm can efficiently provide high-quality consensus sequences using both PacBio and Oxford Nanopore sequencing technologies. With only 30× PacBio data, Sparc can reach a consensus with error rate <0.5%. With the more challenging Oxford Nanopore data, Sparc can also achieve similar error rate when combined with NGS data. Compared with the existing approaches, Sparc[i] calculates the consensus with higher accuracy, uses 80% less memory and time, approximately. The source code is available for download at https://github.com/yechengxi/Sparc .
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
An Eulerian path approach to DNA fragment assembly
Pevzner, P. A., Tang, H., & Waterman, M. S. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.171285098 · Cited by 1,352
Nagarajan, N., & Pop, M. (2013) · Nature Reviews Genetics · doi:10.1038/nrg3367 · Cited by 474
Improving PacBio Long Read Accuracy by Short Read Alignment
Au, K. F., Underwood, J. G., Lee, L., & Wong, W. H. (2012) · PLoS ONE · doi:10.1371/journal.pone.0046679 · Cited by 335
Ye, C., Hill, C. M., Wu, S., Ruan, J., & Ma, Z. (2016) · Scientific Reports · doi:10.1038/srep31900 · Cited by 304
Self-citationMullikin, J. C., & Ning, Z. (2003) · Genome Research · doi:10.1101/gr.731003 · Cited by 222
Cited by
Fast and accurate de novo genome assembly from long uncorrected reads
Vaser, R., Sović, I., Nagarajan, N., & Šikić, M. (2017) · Genome Research · doi:10.1101/gr.214270.116 · Cited by 3,043
Sequencing DNA with nanopores: Troubles and biases
Delahaye, C., & Nicolas, J. (2021) · PLOS ONE · doi:10.1371/journal.pone.0257521 · Cited by 534
Smith, J. J., Timoshevskaya, N., Ye, C., Holt, C., Keinath, M. C., Parker, H. J., Cook, M. E., Hess, J. E., Narum, S. R., Lamanna, F., et al. (2018) · Nature Genetics · doi:10.1038/s41588-017-0036-1 · Cited by 305
Self-citationYe, C., Hill, C. M., Wu, S., Ruan, J., & Ma, Z. (2016) · Scientific Reports · doi:10.1038/srep31900 · Cited by 304
Self-citationNovel genetic basis of resistance to Bt toxin Cry1Ac in Helicoverpa zea
Benowitz, K. M., Allan, C. W., Degain, B. A., Li, X., Fabrick, J. A., Tabashnik, B. E., Carrière, Y., & Matzkin, L. M. (2022) · Genetics · doi:10.1093/genetics/iyac037 · Cited by 35
Metadata
- Authors
- Ye, C., & Ma, Z. (.
- Venue
- PeerJ
- Publisher
- PeerJ
- Published
- 2016-06-08
- Volume
- 4
- Pages
- e2016
- ISSN
- 2167-8359 (ISSN-L)
- OpenAlex
- W1840547926
- Cited by
- 42
- References
- 5
- FWCI
- 2.86
- Type
- journal article
- Language
- en
- Open access
- gold
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.