Parallel short sequence assembly of transcriptomes
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
BACKGROUND: The de novo assembly of genomes and transcriptomes from short sequences is a challenging problem. Because of the high coverage needed to assemble short sequences as well as the overhead of modeling the assembly problem as a graph problem, the methods for short sequence assembly are often validated using data from BACs or small sized prokaryotic genomes. RESULTS: We present a parallel method for transcriptome assembly from large short sequence data sets. Our solution uses a rigorous graph theoretic framework and tames the computational and space complexity using parallel computers. First, we construct a distributed bidirected graph that captures overlap information. Next, we compact all chains in this graph to determine long unique contigs using undirected parallel list ranking, a problem for which we present an algorithm. Finally, we process this compacted distributed graph to resolve unique regions that are separated by repeats, exploiting the naturally occurring coverage variations arising from differential expression. CONCLUSION: We demonstrate the validity of our method using a synthetic high coverage data set generated from the predicted coding regions of Zea mays. We assemble 925 million sequences consisting of 40 billion nucleotides in a few minutes on a 1024 processor Blue Gene/L. Our method is the first fully distributed method for assembling a non-hierarchical short sequence data set and can scale to large problem sizes.
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
Goh, K.-I., Cusick, M. E., Valle, D., Childs, B., Vidal, M., & Barabási, A.-L. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0701361104 · Cited by 3,242
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
The fragment assembly string graph
Myers, E. W. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti1114 · Cited by 424 · cited 5×
“We follow Myers' and Medvedev's lead [3,11] and model the assembly problem as that of finding a tour of a bidirected string graph, which we consider a natural model.”
BackgroundMethodInfluential
Cited by
Oases:robust de novo RNA-seq assembly across the dynamic range of expression levels
Schulz, M. H., Zerbino, D. R., Vingron, M., & Birney, E. (2012) · Bioinformatics · doi:10.1093/bioinformatics/bts094 · Cited by 1,424
Garg, R., Patel, R. K., Tyagi, A. K., & Jain, M. (2011) · DNA Research · doi:10.1093/dnares/dsq028 · Cited by 457
De novo transcriptome assembly with ABySS
Birol, I., Jackman, S. D., Nielsen, C. B., Qian, J. Q., Varhol, R., Stazyk, G., Morin, R. D., Zhao, Y., Hirst, M., Schein, J. E., et al. (2009) · Bioinformatics · doi:10.1093/bioinformatics/btp367 · Cited by 400
Estimation of alternative splicing isoform frequencies from RNA-Seq data
Nicolae, M., Mangul, S., Măndoiu, I. I., & Zelikovsky, A. (2011) · Algorithms for Molecular Biology · doi:10.1186/1748-7188-6-9 · Cited by 178
“Although showing encouraging results, de novo transcriptome assembly algorithms such as [15-17] have difficulties in identifying transcripts with moderate coverage.”
ResultRnnotator: an automated de novo transcriptome assembly pipeline from stranded RNA-Seq reads
Martin, J., Bruno, V. M., Fang, Z., Meng, X., Blow, M., Zhang, T., Sherlock, G., Snyder, M., & Wang, Z. (2010) · BMC Genomics · doi:10.1186/1471-2164-11-663
Metadata
- Authors
- Jackson, B. G., Schnable, P. S., & Aluru, S.
- Venue
- BMC Bioinformatics
- Published
- 2009-01
- Volume
- 10
- Issue
- S1
- Pages
- S14-S14
- ISSN
- 1471-2105 (ISSN-L)
- OpenAlex
- W2155011418
- Cited by
- 40
- References
- 3
- FWCI
- 3.12
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Parallel short sequence assembly of transcriptomes. https://app.cochat.ai/papers/10.1186/1471-2105-10-s1-s14
- The paper
- Jackson, B. G., Schnable, P. S., & Aluru, S. (2009). Parallel short sequence assembly of transcriptomes. BMC Bioinformatics. https://doi.org/10.1186/1471-2105-10-s1-s14
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.