The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
High speed BLASTN: an accelerated MegaBLAST search tool
Open accessAbstract
Sequence alignment is a long standing problem in bioinformatics. The Basic Local Alignment Search Tool (BLAST) is one of the most popular and fundamental alignment tools. The explosive growth of biological sequences calls for speedup of sequence alignment tools such as BLAST. To this end, we develop high speed BLASTN (HS-BLASTN), a parallel and fast nucleotide database search tool that accelerates MegaBLAST—the default module of NCBI-BLASTN. HS-BLASTN builds a new lookup table using the FMD-index of the database and employs an accurate and effective seeding method to find short stretches of identities (called seeds) between the query and the database. HS-BLASTN produces the same alignment results as MegaBLAST and its computational speed is much faster than MegaBLAST. Specifically, our experiments conducted on a 12-core server show that HS-BLASTN can be 22 times faster than MegaBLAST and exhibits better parallel performance than MegaBLAST. HS-BLASTN is written in C++ and the related source code is available at https://github.com/chenying2016/queries under the GPLv3 license.
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
Basic local alignment search tool
Altschul, S. F., Gish, W., Miller, W., Myers, E. W., & Lipman, D. J. (1990) · Journal of Molecular Biology · doi:10.1006/jmbi.1990.9999 · Cited by 98,669
Gapped BLAST and PSI-BLAST: a new generation of protein database search programs
Altschul, S. (1997) · Nucleic Acids Research · doi:10.1093/nar/25.17.3389 · Cited by 73,302
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
Fast gapped-read alignment with Bowtie 2
Langmead, B., & Salzberg, S. L. (2012) · Nature Methods · doi:10.1038/nmeth.1923 · Cited by 56,400
BLAST+: architecture and applications
Camacho, C., Coulouris, G., Avagyan, V., Ma, N., Papadopoulos, J., Bealer, K., & Madden, T. L. (2009) · BMC Bioinformatics · doi:10.1186/1471-2105-10-421 · Cited by 22,074
Search and clustering orders of magnitude faster than BLAST
Edgar, R. C. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btq461 · Cited by 20,826
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
Fast and sensitive protein alignment using DIAMOND
Buchfink, B., Xie, C., & Huson, D. H. (2015) · Nature Methods · doi:10.1038/nmeth.3176 · Cited by 14,201
Grossman, P. (2009) · Discrete Mathematics for Computing · doi:10.1007/978-0-230-37405-8_1 · Cited by 8,834
<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
A Greedy Algorithm for Aligning DNA Sequences
Zhang, Z., Schwartz, S., Wagner, L., & Miller, W. (2000) · Journal of Computational Biology · doi:10.1089/10665270050081478 · Cited by 5,478
The COG database: a tool for genome-scale analysis of protein functions and evolution
Tatusov, R. L. (2000) · Nucleic Acids Research · doi:10.1093/nar/28.1.33 · Cited by 4,520
A map of human genome sequence variation containing 1.42 million single nucleotide polymorphisms
The International SNP Map Working Group, Laboratories:, C. S. H., Sachidanandam, R., Weissman, D., Schmidt, S. C., Kakol, J. M., Stein, L. D., National Center for Biotechnology Information:, Marth, G., Sherry, S., et al. (2001) · Nature · doi:10.1038/35057149 · Cited by 2,977
A Block-sorting Lossless Data Compression Algorithm
Burrows, M. T., & Wheeler, D. J. (1994) · Cited by 2,333
Rost, B., Yachdav, G., & Liu, J. (2004) · Nucleic Acids Research · doi:10.1093/nar/gkh377 · Cited by 1,453
Database indexing for production MegaBLAST searches
Morgulis, A., Coulouris, G., Raytselis, Y., Madden, T. L., Agarwala, R., & Schäffer, A. A. (2008) · Bioinformatics · doi:10.1093/bioinformatics/btn322 · Cited by 1,299
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
SSAHA: A Fast Search Method for Large DNA Databases
Ning, Z., Cox, A. J., & Mullikin, J. C. (2001) · Genome Research · doi:10.1101/gr.194201 · Cited by 965
Exploring single-sample SNP and INDEL calling with whole-genome de novo assembly
Li, H. (2012) · Bioinformatics · doi:10.1093/bioinformatics/bts280 · Cited by 398
WindowMasker: window-based masker for sequenced genomes
Morgulis, A., Gertz, E. M., Schäffer, A. A., & Agarwala, R. (2006) · Bioinformatics · doi:10.1093/bioinformatics/bti774 · Cited by 311
Protein function annotation by homology-based inference
Loewenstein, Y., Raimondo, D., Redfern, O. C., Watson, J., Frishman, D., Linial, M., Orengo, C., Thornton, J., & Tramontano, A. (2009) · Genome Biology · doi:10.1186/gb-2009-10-2-207 · Cited by 221
GPU-BLAST: using graphics processors to accelerate protein sequence alignment
Vouzis, P. D., & Sahinidis, N. V. (2011) · Bioinformatics · doi:10.1093/bioinformatics/btq644 · Cited by 212
OEHMEN, C. S., & Nieplocha, J. (2006) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2006.112 · Cited by 140
Computational Gene Prediction Using Multiple Sources of EvidencePreprint
Allen, J. E., Pertea, M., & Salzberg, S. L. (2004) · Genome Research · doi:10.1101/gr.1562804 · Cited by 132
Long read alignment based on maximal exact match seeds
Liu, Y., & Schmidt, B. (2012) · Bioinformatics · doi:10.1093/bioinformatics/bts414 · Cited by 126
A General Reconfigurable Architecture for the BLAST Algorithm
Sotiriades, E., & Dollas, A. (2007) · The Journal of VLSI Signal Processing Systems for Signal Image and Video Technology · doi:10.1007/s11265-007-0069-2 · Cited by 59
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
Compressive genomics for protein databases
Daniels, N. M., Gallant, A., Peng, J., Cowen, L., Baym, M., & Berger, B. (2013) · Bioinformatics · doi:10.1093/bioinformatics/btt214 · Cited by 50
miBLAST: scalable evaluation of a batch of nucleotide sequence queries with BLAST
Kim, Y. J., Boyd, A., Athey, B. D., & Patel, J. M. (2005) · Nucleic Acids Research · doi:10.1093/nar/gki739 · Cited by 43
Cited by
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
Shukla, S., Mishra, B., Avashthi, H., & Chandra, M. (2022) · Bioinformatics · doi:10.1016/b978-0-323-89775-4.00003-1 · Cited by 1,244
New insights from uncultivated genomes of the global human gut microbiome
Nayfach, S., Shi, Z. J., Seshadri, R., Pollard, K. S., & Kyrpides, N. C. (2019) · Nature · doi:10.1038/s41586-019-1058-x · Cited by 737
Nayfach, S., Rodriguez-Mueller, B., Garud, N., & Pollard, K. S. (2016) · Genome Research · doi:10.1101/gr.201863.115 · Cited by 470
Camargo, A. P., Nayfach, S., Chen, I.-M. A., Palaniappan, K., Ratner, A., Chu, K., Ritter, S. J., Reddy, T. B. K., Mukherjee, S., Schulz, F., et al. (2023) · Nucleic Acids Research · doi:10.1093/nar/gkac1037 · Cited by 446
Metadata
- Authors
- Chen, Y., Ye, W., Zhang, Y., & Xu, Y.
- Venue
- Nucleic Acids Research
- Publisher
- Oxford University Press (OUP)
- Published
- 2015
- Volume
- 43
- Issue
- 16
- Pages
- 7762-7768
- ISSN
- 0305-1048 (ISSN-L)
- 1362-4962
- OpenAlex
- W1630717967
- Cited by
- 744
- References
- 29
- FWCI
- 9.38
- 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.