The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Meta-IDBA: a de Novo assembler for metagenomic data
Open accessAbstract
Motivation: Next-generation sequencing techniques allow us to generate reads from a microbial environment in order to analyze the microbial community. However, assembling of a set of mixed reads from different species to form contigs is a bottleneck of metagenomic research. Although there are many assemblers for assembling reads from a single genome, there are no assemblers for assembling reads in metagenomic data without reference genome sequences. Moreover, the performances of these assemblers on metagenomic data are far from satisfactory, because of the existence of common regions in the genomes of subspecies and species, which make the assembly problem much more complicated. Results: We introduce the Meta-IDBA algorithm for assembling reads in metagenomic data, which contain multiple genomes from different species. There are two core steps in Meta-IDBA. It first tries to partition the de Bruijn graph into isolated components of different species based on an important observation. Then, for each component, it captures the slight variants of the genomes of subspecies from the same species by multiple alignments and represents the genome of one species, using a consensus sequence. Comparison of the performances of Meta-IDBA and existing assemblers, such as Velvet and Abyss for different metagenomic datasets shows that Meta-IDBA can reconstruct longer contigs with similar accuracy. Availability: Meta-IDBA toolkit is available at our website http://www.cs.hku.hk/~alse/metaidba. Contact: chin@cs.hku.hk
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
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
Velvet: 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
<tt>BLAT</tt> —The <tt>BLAST</tt> -Like Alignment Tool
Kent, W. J. (2002) · Genome Research · doi:10.1101/gr.229202 · Cited by 8,480
ABySS: 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
MEGAN analysis of metagenomic data
Huson, D. H., Auch, A. F., Qi, J., & Schuster, S. C. (2007) · Genome Research · doi:10.1101/gr.5969107 · Cited by 3,312
De novo assembly of human genomes with massively parallel short read sequencing
Li, R., Zhu, H., Ruan, J., Qian, W., Fang, X., Shi, Z., Li, Y., Li, S., Shan, G., Kristiansen, K., et al. (2010) · Genome Research · doi:10.1101/gr.097261.109 · Cited by 2,926
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
NCBI Reference Sequences: current status, policy and new initiatives
Pruitt, K. D., Tatusova, T., Klimke, W., & Maglott, D. R. (2009) · Nucleic Acids Research · doi:10.1093/nar/gkn721 · Cited by 736
Wooley, J. C., Godzik, A., & Friedberg, I. (2010) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000667 · Cited by 688
Short read fragment assembly of bacterial genomes
Chaisson, M. J., & Pevzner, P. A. (2008) · Genome Research · doi:10.1101/gr.7088808 · Cited by 441
Genome assembly reborn: recent computational challenges
Pop, M. (2009) · Briefings in Bioinformatics · doi:10.1093/bib/bbp026 · Cited by 387
Use of simulated data sets to evaluate the fidelity of metagenomic processing methods
Mavromatis, K., Ivanova, N., Barry, K., Shapiro, H., Goltsman, E., McHardy, A. C., Rigoutsos, I., Salamov, A., Korzeniewski, F., Land, M., et al. (2007) · Nature Methods · doi:10.1038/nmeth1043 · Cited by 344
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
Self-citationPhylogenetic classification of short environmental DNA fragments
Krause, L., Diaz, N. N., Goesmann, A., Kelley, S., Nattkemper, T. W., Rohwer, F., Edwards, R. A., & Stoye, J. (2008) · Nucleic Acids Research · doi:10.1093/nar/gkn038 · Cited by 285
De novo fragment assembly with short mate-paired reads: Does the read length matter?
Chaisson, M. J., Brinza, D., & Pevzner, P. A. (2009) · Genome Research · doi:10.1101/gr.079053.108 · Cited by 279
Zerbino, D. R., McEwen, G. K., Margulies, E. H., & Birney, E. (2009) · PLoS ONE · doi:10.1371/journal.pone.0008407 · Cited by 223
Predicting microbial species richness
Hong, S.-H., Bunge, J., Jeon, S.-O., & Epstein, S. S. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0507245102 · Cited by 214
A Novel Abundance-Based Algorithm for Binning Metagenomic Sequences Using l -tuples
Wu, Y.-W., & Ye, Y. (2011) · Journal of Computational Biology · doi:10.1089/cmb.2010.0245 · Cited by 180
How independent are the appearances of n-mers in different genomes?
Fofanov, Y., Luo, Y., Katili, C., Wang, J. J., Belosludtsev, Y. Y., Powdrill, T. F., Belapurkar, C., Fofanov, V. Y., Li, T.-B., Chumakov, S. M., et al. (2004) · Bioinformatics · doi:10.1093/bioinformatics/bth266 · Cited by 92
Assisted assembly: how to improve a de novo genome assembly by using related species
Gnerre, S., Lander, E. S., Lindblad‐Toh, K., & Jaffe, D. B. (2009) · Genome biology · doi:10.1186/gb-2009-10-8-r88 · Cited by 64
Species richness in soil bacterial communities: A proposed approach to overcome sample size bias
Youssef, N. H., & Elshahed, M. S. (2008) · Journal of Microbiological Methods · doi:10.1016/j.mimet.2008.05.009 · Cited by 41
A Novel Abundance-Based Algorithm for Binning Metagenomic Sequences Using l-Tuples
Wu, Y., & Ye, Y. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12683-3_35 · Cited by 36
MetaCluster: unsupervised binning of environmental genomic fragments and taxonomic annotation
Yang, B., Peng, Y., Leung, H. C. M., Yiu, S., Qin, J., Li, R., & Chin, F. Y. L. (2010) · ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics (ACM-BCB) · doi:10.1145/1854776.1854803 · Cited by 35
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
Shotgun metagenomics, from sampling to analysis
Quince, C., Walker, A. W., Simpson, J. T., Loman, N. J., & Segata, N. (2017) · Nature Biotechnology · doi:10.1038/nbt.3935 · Cited by 2,202
Li, D., Luo, R., Liu, C.-M., Leung, C.-M., Ting, H.-F., Sadakane, K., Yamashita, H., & Lam, T.-W. (2016) · Methods · doi:10.1016/j.ymeth.2016.02.020 · Cited by 2,079
Next-Generation Sequencing Technology: Current Trends and Advancements
Satam, H., Joshi, K., Mangrolia, U., Waghoo, S., Zaidi, G., Rawool, S., Thakare, R. P., Banday, S., Mishra, A. K., Das, G., et al. (2023) · Biology · doi:10.3390/biology12070997 · Cited by 1,299
Namiki, T., Hachiya, T., Tanaka, H., & Sakakibara, Y. (2012) · Nucleic Acids Research · doi:10.1093/nar/gks678 · Cited by 668
Metadata
- Authors
- Peng, Y., Leung, H. C. M., Yiu, S. M., & Chin, F. Y. L.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2011-06-14
- Volume
- 27
- Issue
- 13
- Pages
- i94-i101
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2113915152
- Cited by
- 323
- References
- 23
- FWCI
- 12.46
- 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.