The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
MEGAHIT v1.0: A fast and scalable metagenome assembler driven by advanced methodologies and community practices
Open accessAbstract
The study of metagenomics has been much benefited from low-cost and high-throughput sequencing technologies, yet the tremendous amount of data generated make analysis like de novo assembly to consume too much computational resources. In late 2014 we released MEGAHIT v0.1 (together with a brief note of Li et al. (2015) [1]), which is the first NGS metagenome assembler that can assemble genome sequences from metagenomic datasets of hundreds of Giga base-pairs (bp) in a time- and memory-efficient manner on a single server. The core of MEGAHIT is an efficient parallel algorithm for constructing succinct de Bruijn Graphs (SdBG), implemented on a graphical processing unit (GPU). The software has been well received by the assembly community, and there is interest in how to adapt the algorithms to integrate popular assembly practices so as to improve the assembly quality, as well as how to speed up the software using better CPU-based algorithms (instead of GPU). In this paper we first describe the details of the core algorithms in MEGAHIT v0.1, and then we show the new modules to upgrade MEGAHIT to version v1.0, which gives better assembly quality, runs faster and uses less memory. For the Iowa Prairie Soil dataset (252Gbp after quality trimming), the assembly quality of MEGAHIT v1.0, when compared with v0.1, has a significant improvement, namely, 36% increase in assembly size and 23% in N50. More interestingly, MEGAHIT v1.0 is no slower than before (even running with the extra modules). This is primarily due to a new CPU-based algorithm for SdBG construction that is faster and requires less memory. Using CPU only, MEGAHIT v1.0 can assemble the Iowa Prairie Soil sample in about 43h, reducing the running time of v0.1 by at least 25% and memory usage by up to 50%. MEGAHIT v1.0, exhibiting a smaller memory footprint, can process even larger datasets. The Kansas Prairie Soil sample (484Gbp), the largest publicly available dataset, can now be assembled using no more than 500GB of memory in 7.5days. The assemblies of these datasets (and other large metgenomic datasets), as well as the software, are available at the website https://hku-bal.github.io/megabox.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Trimmomatic: a flexible trimmer for Illumina sequence data
Bolger, A. M., Lohse, M., & Usadel, B. (2014) · Bioinformatics · doi:10.1093/bioinformatics/btu170 · Cited by 65,548
Fast gapped-read alignment with Bowtie 2
Langmead, B., & Salzberg, S. L. (2012) · Nature Methods · doi:10.1038/nmeth.1923 · Cited by 56,400
SPAdes: A New Genome Assembly Algorithm and Its Applications to Single-Cell Sequencing
Bankevich, A., Nurk, S., Antipov, D., Gurevich, A. A., Dvorkin, M., Kulikov, A. S., Lesin, V. M., Nikolenko, S. I., Pham, S., Prjibelski, A. D., et al. (2012) · Journal of Computational Biology · doi:10.1089/cmb.2012.0021 · Cited by 25,987
Structure, function and diversity of the healthy human microbiome
The Human Microbiome Project Consortium (2012) · Nature · doi:10.1038/nature11234 · Cited by 11,726
A human gut microbial gene catalogue established by metagenomic sequencing
MetaHIT Consortium, Qin, J., Li, R., Raes, J., Arumugam, M., Burgdorf, K. S., Manichanh, C., Nielsen, T., Pons, N., Levenez, F., et al. (2010) · Nature · doi:10.1038/nature08821 · Cited by 11,624
Self-citationLi, D., Liu, C.-M., Luo, R., Sadakane, K., & Lam, T.-W. (2015) · Bioinformatics · doi:10.1093/bioinformatics/btv033 · Cited by 9,893
Self-citationVelvet: Algorithms for de novo short read assembly using de Bruijn graphs
Zerbino, D. R., & Birney, E. (2008) · Genome Research · doi:10.1101/gr.074492.107 · Cited by 9,491
A metagenome-wide association study of gut microbiota in type 2 diabetes
Qin, J., Li, Y., Cai, Z., Li, S., Zhu, J., Zhang, F., Liang, S., Zhang, W., Guan, Y., Shen, D., et al. (2012) · Nature · doi:10.1038/nature11450 · Cited by 6,762
SOAPdenovo2: an empirically improved memory-efficient short-read de novo assembler
Luo, R., Liu, B., Xie, Y., Li, Z., Huang, W., Yuan, J., He, G., Chen, Y., Pan, Q., Liu, Y., et al. (2012) · Gigascience · doi:10.1186/2047-217x-1-18 · Cited by 5,307
Self-citationABySS: A parallel assembler for short read sequence data
Simpson, J. T., Wong, K., Jackman, S. D., Schein, J. E., Jones, S. J. M., & Birol, İ. (2009) · Genome Research · doi:10.1101/gr.089532.108 · Cited by 3,608
Bandage: interactive visualization of de novo genome assemblies
Wick, R. R., Schultz, M. B., Zobel, J., & Holt, K. E. (2015) · Bioinformatics · doi:10.1093/bioinformatics/btv383 · Cited by 3,029
Peng, Y., Leung, H. C. M., Yiu, S. M., & Chin, F. Y. L. (2012) · Bioinformatics · doi:10.1093/bioinformatics/bts174 · Cited by 2,989
Binning metagenomic contigs by coverage and composition
Alneberg, J., Bjarnason, B. S., de Bruijn, I., Schirmer, M., Quick, J., Ijaz, U. Z., Lahti, L., Loman, N. J., Andersson, A. F., & Quince, C. (2014) · Nature Methods · doi:10.1038/nmeth.3103 · Cited by 2,800
A Block-sorting Lossless Data Compression Algorithm
Burrows, M. T., & Wheeler, D. J. (1994) · Cited by 2,333
Metagenomic discovery of biomass-degrading genes and genomes from cow rumen
Hess, M., Sczyrba, A., Egan, R., Kim, T.-W., Chokhawala, H., Schroth, G., Luo, S., Clark, D. S., Chen, F., Zhang, T., et al. (2011) · Science · doi:10.1126/science.1200387 · Cited by 1,319
Namiki, T., Hachiya, T., Tanaka, H., & Sakakibara, Y. (2012) · Nucleic Acids Research · doi:10.1093/nar/gks678 · Cited by 668
Ray Meta: scalable de novo metagenome assembly and profiling
Boisvert, S., Raymond, F., Godzaridis, É., Laviolette, F., & Corbeil, J. (2012) · Genome Biology · doi:10.1186/gb-2012-13-12-r122 · Cited by 590
Nagarajan, N., & Pop, M. (2013) · Nature Reviews Genetics · doi:10.1038/nrg3367 · Cited by 474
SOAP3-dp: Fast, Accurate and Sensitive GPU-Based Short Read Aligner
Luo, R., Wong, T., Zhu, J., Liu, C.-M., Zhu, X., Wu, E., Lee, L.-K., Lin, H., Zhu, W., Cheung, D. W., et al. (2013) · PLoS ONE · doi:10.1371/journal.pone.0065632 · Cited by 425
Self-citationExploiting sparseness in de novo genome assembly
Ye, C., Ma, Z. S., Cannon, C. H., Pop, M., & Yu, D. W. (2012) · BMC Bioinformatics · doi:10.1186/1471-2105-13-s6-s1 · Cited by 412
Compressed representations of sequences and full-text indexes
Ferragina, P., Manzini, G., Mäkinen, V., & Navarro, G. (2007) · ACM Transactions on Algorithms · doi:10.1145/1240233.1240243 · Cited by 373
Space-efficient and exact de Bruijn graph representation based on a Bloom filter
Chikhi, R., & Rizk, G. (2013) · Algorithms for Molecular Biology · doi:10.1186/1748-7188-8-22 · Cited by 361
Meta-IDBA: a de Novo assembler for metagenomic data
Peng, Y., Leung, H. C. M., Yiu, S. M., & Chin, F. Y. L. (2011) · Bioinformatics · doi:10.1093/bioinformatics/btr216 · Cited by 323
Tackling soil diversity with the assembly of large, complex metagenomes
Howe, A. C., Jansson, J. K., Malfatti, S. A., Tringe, S. G., Tiedje, J. M., & Brown, C. T. (2014) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1402564111 · Cited by 321
IDBA – A Practical Iterative de Bruijn Graph De Novo Assembler
Peng, Y., Leung, H. C. M., Yiu, S. M., & Chin, F. Y. L. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-12683-3_28 · Cited by 293
Scaling metagenome sequence assembly with probabilistic de Bruijn graphs
Pell, J., Hintze, A., Canino-Koning, R., Howe, A., Tiedje, J. M., & Brown, C. T. (2012) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1121464109 · Cited by 247
Efficient de novo assembly of single-cell bacterial genomes from short-read data sets
Chitsaz, H., Yee-Greenbaum, J. L., Tesler, G., Lombardo, M.-J., Dupont, C. L., Badger, J. H., Novotny, M., Rusch, D. B., Fraser, L. J., Gormley, N. A., et al. (2011) · Nature Biotechnology · doi:10.1038/nbt.1966 · Cited by 236
Shakya, M., Quince, C., Campbell, J. H., Yang, Z. K., Schadt, C. W., & Podar, M. (2013) · Environmental Microbiology · doi:10.1111/1462-2920.12086 · Cited by 214
Bowe, A., Onodera, T., Sadakane, K., & Shibuya, T. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33122-0_18 · Cited by 167
Self-citationCorrection: SOAP3-dp: Fast, Accurate and Sensitive GPU-Based Short Read Aligner
Luo, R., Wong, T. K. F., Zhu, J.-Q., Liu, C.-M., Zhu, X., Wu, E., Lee, L., Lin, H., Zhu, W., Cheung, D. W.-L., et al. (2013) · PLoS ONE · doi:10.1371/annotation/823f3670-ed17-41ec-ba51-b50281651915 · Cited by 27
Self-citation
Cited by
metaSPAdes: a new versatile metagenomic assembler
Nurk, S., Meleshko, D., Korobeynikov, A., & Pevzner, P. A. (2017) · Genome Research · doi:10.1101/gr.213959.116 · Cited by 4,496
MetaWRAP—a flexible pipeline for genome-resolved metagenomic data analysis
Uritskiy, G. V., DiRuggiero, J., & Taylor, J. (2018) · Microbiome · doi:10.1186/s40168-018-0541-1 · Cited by 2,642
NRT1.1B is associated with root microbiota composition and nitrogen use in field-grown rice
Zhang, J., Liu, Y.-X., Zhang, N., Hu, B., Jin, T., Xu, H., Qin, Y., Yan, P., Zhang, X., Guo, X., et al. (2019) · Nature Biotechnology · doi:10.1038/s41587-019-0104-4 · Cited by 1,119
The tomato pan-genome uncovers new genes and a rare allele regulating fruit flavor
Gao, L., Gonda, I., Sun, H., Ma, Q., Bao, K., Tieman, D. M., Burzynski-Chang, E. A., Fish, T. L., Stromberg, K. A., Sacks, G. L., et al. (2019) · Nature Genetics · doi:10.1038/s41588-019-0410-2 · Cited by 717
SKESA: strategic k-mer extension for scrupulous assemblies
Souvorov, A., Agarwala, R., & Lipman, D. J. (2018) · Genome Biology · doi:10.1186/s13059-018-1540-z · Cited by 695
Metadata
- Authors
- Li, D., Luo, R., Liu, C.-M., Leung, C.-M., Ting, H.-F., Sadakane, K., Yamashita, H., & Lam, T.-W.
- Venue
- Methods
- Publisher
- Elsevier BV
- Published
- 2016-06
- Volume
- 102
- Pages
- 3-11
- ISSN
- 1046-2023 (ISSN-L)
- OpenAlex
- W2303656007
- Cited by
- 2,079
- References
- 30
- FWCI
- 28.29
- Type
- journal article
- Language
- en
- Open access
- green
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.