The DOI matches its Crossref record; 45 of the 45 references it cites were found in a registry or an index.
Exploring single-sample SNP and INDEL calling with whole-genome de novo assembly
Open accessAbstract
Motivation: Eugene Myers in his string graph paper suggested that in a string graph or equivalently a unitig graph, any path spells a valid assembly. As a string/unitig graph also encodes every valid assembly of reads, such a graph, provided that it can be constructed correctly, is in fact a lossless representation of reads. In principle, every analysis based on whole-genome shotgun sequencing (WGS) data, such as SNP and insertion/deletion (INDEL) calling, can also be achieved with unitigs. Results: To explore the feasibility of using de novo assembly in the context of resequencing, we developed a de novo assembler, fermi, that assembles Illumina short reads into unitigs while preserving most of information of the input reads. SNPs and INDELs can be called by mapping the unitigs against a reference genome. By applying the method on 35-fold human resequencing data, we showed that in comparison to the standard pipeline, our approach yields similar accuracy for SNP calling and better results for INDEL calling. It has higher sensitivity than other de novo assembly based methods for variant calling. Our work suggests that variant calling with de novo assembly can be a beneficial complement to the standard variant calling pipeline for whole-genome resequencing. In the methodological aspects, we propose FMD-index for forward–backward extension of DNA sequences, a fast algorithm for finding all super-maximal exact matches and one-pass construction of unitigs from an FMD-index. Availability: http://github.com/lh3/fermi Contact: hengli@broadinstitute.org
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
Fast and accurate short read alignment with Burrows-Wheeler transform
Li, H., & Durbin, R. (2009) · Bioinformatics · doi:10.1093/bioinformatics/btp324 · Cited by 58,607
Self-citationFast and accurate long-read alignment with Burrows-Wheeler transform.
Li, H., & Durbin, R. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btp698 · Cited by 12,063
Self-citationA framework for variation discovery and genotyping using next-generation DNA sequencing data
DePristo, M. A., Banks, E., Poplin, R., Garimella, K. V., Maguire, J. R., Hartl, C., Philippakis, A. A., del Angel, G., Rivas, M. A., Hanna, M., et al. (2011) · Nature Genetics · doi:10.1038/ng.806 · Cited by 11,456
A map of human genome variation from population-scale sequencing.
The 1000 Genomes Project Consortium (2010) · Nature · doi:10.1038/nature09534 · Cited by 7,877
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
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
Mapping short DNA sequencing reads and calling variants using mapping quality scores
Li, H., Ruan, J., & Durbin, R. (2008) · Genome Research · doi:10.1101/gr.078212.108 · Cited by 2,638
Self-citationA Block-sorting Lossless Data Compression Algorithm
Burrows, M. T., & Wheeler, D. J. (1994) · Cited by 2,333
The Diploid Genome Sequence of an Individual Human
Levy, S., Sutton, G., Ng, P. C., Feuk, L., Halpern, A. L., Walenz, B. P., Axelrod, N., Huang, J., Kirkness, E. F., Denisov, G., et al. (2007) · PLoS Biology · doi:10.1371/journal.pbio.0050254 · Cited by 1,778
A Whole-Genome Assembly of Drosophila
Myers, E. W., Sutton, G. G., Delcher, A. L., Dew, I. M., Fasulo, D. P., Flanigan, M. J., Kravitz, S. A., Mobarry, C. M., Reinert, K. H. J., Remington, K. A., et al. (2000) · Science · doi:10.1126/science.287.5461.2196 · Cited by 1,538
High-quality draft assemblies of mammalian genomes from massively parallel sequence data
Gnerre, S., MacCallum, I., Przybylski, D., Ribeiro, F. J., Burton, J. N., Walker, B. J., Sharpe, T., Hall, G., Shea, T. P., Sykes, S., et al. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1017351108 · Cited by 1,533
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
Human Genome Sequencing Using Unchained Base Reads on Self-Assembling DNA Nanoarrays
Drmanac, R., Sparks, A. B., Callow, M. J., Halpern, A. L., Burns, N. L., Kermani, B. G., Carnevali, P., Nazarenko, I., Nilsen, G. B., Yeung, G., et al. (2010) · Science · doi:10.1126/science.1181498 · Cited by 1,212
Universal codeword sets and representations of the integers
Elias, P. (1975) · IEEE Transactions on Information Theory · doi:10.1109/tit.1975.1055349 · Cited by 1,165
Opportunistic data structures with applications
Ferragina, P., & Manzini, G. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892127 · Cited by 1,063
Efficient de novo assembly of large genomes using compressed data structures
Simpson, J. T., & Durbin, R. (2012) · Genome Research · doi:10.1101/gr.126953.111 · Cited by 768
De novo assembly and genotyping of variants using colored de Bruijn graphs
Iqbal, Z., Caccamo, M., Turner, I., Flicek, P., & McVean, G. (2012) · Nature Genetics · doi:10.1038/ng.1028 · Cited by 634
Sequencing of natural strains of Arabidopsis thaliana with short reads
Ossowski, S., Schneeberger, K., Clark, R. M., Lanz, C., Warthmann, N., & Weigel, D. (2008) · Genome Research · doi:10.1101/gr.080200.108 · Cited by 464
The fragment assembly string graph
Myers, E. W. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti1114 · Cited by 424
Dindel: Accurate indel calls from short-read data
Albers, C. A., Lunter, G., MacArthur, D. G., McVean, G., Ouwehand, W. H., & Durbin, R. (2011) · Genome Research · doi:10.1101/gr.112326.110 · Cited by 410
A strategy of DNA sequencing employing computer programs
Staden, R. (1979) · Nucleic Acids Research · doi:10.1093/nar/6.7.2601 · Cited by 409
A New Algorithm for DNA Sequence Assembly
IDURY, R. M., & WATERMAN, M. S. (1995) · Journal of Computational Biology · doi:10.1089/cmb.1995.2.291 · Cited by 342
Improving SNP discovery by base alignment quality
Li, H. (2011) · Bioinformatics · doi:10.1093/bioinformatics/btr076 · Cited by 320
Self-citationPerformance comparison of whole-genome sequencing platforms
Lam, H. Y. K., Clark, M. J., Chen, R., Chen, R., Natsoulis, G., O'Huallachain, M., Dewey, F. E., Habegger, L., Ashley, E. A., Gerstein, M. B., et al. (2012) · Nature Biotechnology · doi:10.1038/nbt.2065 · Cited by 308
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
Natural genetic variation caused by small insertions and deletions in the human genome
Mills, R. E., Pittard, W. S., Mullaney, J. M., Farooq, U., Creasy, T. H., Mahurkar, A. A., Kemeza, D. M., Strassler, D. S., Ponting, C. P., Webber, C., et al. (2011) · Genome Research · doi:10.1101/gr.115907.110 · Cited by 268
Efficient construction of an assembly string graph using the FM-index
Simpson, J. T., & Durbin, R. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btq217 · Cited by 254
Toward Simplifying and Accurately Formulating Fragment Assembly
MYERS, E. W. (1995) · Journal of Computational Biology · doi:10.1089/cmb.1995.2.275 · Cited by 238
Combinatorial algorithms for DNA sequence assembly
Kececioglu, J. D., & Myers, E. W. (1995) · Algorithmica · doi:10.1007/bf01188580 · Cited by 225
Zerbino, D. R., McEwen, G. K., Margulies, E. H., & Birney, E. (2009) · PLoS ONE · doi:10.1371/journal.pone.0008407 · Cited by 223
Computability of Models for Sequence Assembly
Medvedev, P., Georgiou, K., Myers, G., & Brudno, M. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74126-8_27 · Cited by 160
HiTEC: accurate error correction in high-throughput sequencing data
Ilie, L., Fazayeli, F., & Ilie, S. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btq653 · Cited by 137
High Throughput Short Read Alignment via Bi-directional BWT
Lam, T., Li, R., Tam, A., Wong, S., Wu, E., & Yiu, S. (2009) · IEEE International Conference on Bioinformatics and Biomedicine (BIBM) · doi:10.1109/bibm.2009.42 · Cited by 125
Maximum Likelihood Genome Assembly
Medvedev, P., & Brudno, M. (2009) · Journal of Computational Biology · doi:10.1089/cmb.2009.0047 · Cited by 115
The whole genome assembly of Drosophila
Myers, E. W. (2000) · Symposium on Discrete Algorithms · doi:10.5555/338219.338635 · Cited by 114
SEQAID: a DNA sequence assembling program based on a mathematical model
Peltola, H., Söderlund, H., & Ukkonen, E. (1984) · Nucleic Acids Research · doi:10.1093/nar/12.1part1.307 · Cited by 112
Microindel detection in short-read sequence data
Krawitz, P. M., Rödelsperger, C., Jäger, M., Jostins, L., Bauer, S., & Robinson, P. N. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btq027 · Cited by 108
Lightweight Data Indexing and Compression in External Memory
Ferragina, P., Gagie, T., & Manzini, G. (2011) · Algorithmica · doi:10.1007/s00453-011-9535-0 · Cited by 107
Computational Techniques for Human Genome Resequencing Using Mated Gapped Reads
Carnevali, P., Baccash, J., Halpern, A. L., Nazarenko, I., Nilsen, G. B., Pant, K. P., Ebert, J. C., Brownley, A., Morenzoni, M., Karpinchyk, V., et al. (2011) · Journal of Computational Biology · doi:10.1089/cmb.2011.0201 · Cited by 87
A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays
Hon, W.-K., Lam, T., Sadakane, K., Sung, W.-K. K., & Yiu, S. (2007) · Algorithmica · doi:10.1007/s00453-006-1228-8 · Cited by 83
Homer, N., & Nelson, S. F. (2010) · Genome biology · doi:10.1186/gb-2010-11-10-r99 · Cited by 77
Compressed Suffix Arrays for Massive Data
Sirén, J. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03784-9_7 · Cited by 51
Storage and Retrieval of Individual Genomes
Mäkinen, V., Navarro, G., Sirén, J., & Välimäki, N. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02008-7_9 · Cited by 45
Lightweight Data Indexing and Compression in External Memory
Ferragina, P., Gagie, T., & Manzini, G. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12200-2_60 · Cited by 24
Manske, M., & Kwiatkowski, D. P. (2009) · Bioinformatics · doi:10.1093/bioinformatics/btp403 · Cited by 23
Cited by
Haplotype-resolved de novo assembly using phased assembly graphs with hifiasm
Cheng, H., Concepcion, G. T., Feng, X., Zhang, H., & Li, H. (2021) · Nature Methods · doi:10.1038/s41592-020-01056-5 · Cited by 5,859
Self-citationAligning sequence reads, clone sequences and assembly con*gs with BWA-MEM
Li, H. (2014) · arXiv (Cornell University) · doi:10.6084/m9.figshare.963153.v1 · Cited by 4,932
Self-citationEfficient Architecture-Aware Acceleration of BWA-MEM for Multicore Systems
Vasimuddin, M., Misra, S., Li, H., & Aluru, S. (2019) · 2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2019.00041 · Cited by 3,000
Self-citationMinimap and miniasm: fast mapping and de novo assembly for noisy long sequences
Li, H. (2016) · Bioinformatics · doi:10.1093/bioinformatics/btw152 · Cited by 1,508
Self-citationToward better understanding of artifacts in variant calling from high-coverage samples
Li, H. (2014) · Bioinformatics · doi:10.1093/bioinformatics/btu356 · Cited by 892
Self-citation
Metadata
- Authors
- Li, H.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2012-05-07
- Volume
- 28
- Issue
- 14
- Pages
- 1838-1844
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2105708056
- Cited by
- 398
- References
- 45
- FWCI
- 10.57
- Type
- journal article
- Language
- en
- Open access
- bronze
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.