The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Adaptive seeds tame genomic sequence comparison
Open accessAbstract
The main way of analyzing biological sequences is by comparing and aligning them to each other. It remains difficult, however, to compare modern multi-billionbase DNA data sets. The difficulty is caused by the nonuniform (oligo)nucleotide composition of these sequences, rather than their size per se. To solve this problem, we modified the standard seed-and-extend approach (e.g., BLAST) to use adaptive seeds. Adaptive seeds are matches that are chosen based on their rareness, instead of using fixed-length matches. This method guarantees that the number of matches, and thus the running time, increases linearly, instead of quadratically, with sequence length. LAST, our open source implementation of adaptive seeds, enables fast and sensitive comparison of large sequences with arbitrarily nonuniform composition.
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
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
Tandem repeats finder: a program to analyze DNA sequences
Benson, G. (1999) · Nucleic Acids Research · doi:10.1093/nar/27.2.573 · Cited by 9,374
<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
Sequencing technologies – the next generation
Metzker, M. L. (2010) · Nature Reviews Genetics · doi:10.1038/nrg2626 · Cited by 7,066
Versatile and open software for comparing large genomes
Kurtz, S., Phillippy, A., Delcher, A. L., Smoot, M., Shumway, M., Antonescu, C., & Salzberg, S. L. (2004) · Genome Biology · doi:10.1186/gb-2004-5-2-r12 · Cited by 5,254
Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology
Gusfield, D. (1997) · Cambridge University Press eBooks · doi:10.1017/cbo9780511574931 · Cited by 3,078
Suffix Arrays: A New Method for On-Line String Searches
Manber, U., & Myers, G. (1993) · SIAM Journal on Computing · doi:10.1137/0222058 · Cited by 1,915
Algorithms on strings, trees, and sequences
Gusfield, D. (1997) · Cited by 1,697
Alu repeats and human genomic diversity
Batzer, M. A., & Deininger, P. L. (2002) · Nature Reviews Genetics · doi:10.1038/nrg798 · Cited by 1,470
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
Human–Mouse Alignments with BLASTZ
Schwartz, S., Kent, W. J., Smit, A., Zhang, Z., Baertsch, R., Hardison, R. C., Haussler, D., & Miller, W. (2003) · Genome Research · doi:10.1101/gr.809403 · Cited by 1,239
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
Improved pairwise alignment of genomic dna
Harris, R. S. (2007) · Cited by 890
A survey of sequence alignment algorithms for next-generation sequencing
Li, H., & Homer, N. (2010) · Briefings in Bioinformatics · doi:10.1093/bib/bbq015 · Cited by 875 · cited 1×
“In recent years, many methods have been developed for mapping DNA reads to genomes, allowing for small numbers of differences (Trapnell and Salzberg 2009; Li and Homer 2010).”
MethodPatternHunter: faster and more sensitive homology search
Ma, B., Tromp, J., & Li, M. (2002) · Bioinformatics · doi:10.1093/bioinformatics/18.3.440 · Cited by 829
The regulated retrotransposon transcriptome of mammalian cells
Faulkner, G. J., Kimura, Y., Daub, C. O., Wani, S., Plessy, C., Irvine, K. M., Schroder, K., Cloonan, N., Steptoe, A. L., Lassmann, T., et al. (2009) · Nature Genetics · doi:10.1038/ng.368 · Cited by 828
Replacing suffix trees with enhanced suffix arrays
Abouelhoda, M. I., Kurtz, S., & Ohlebusch, E. (2004) · Journal of Discrete Algorithms · doi:10.1016/s1570-8667(03)00065-0 · Cited by 668
Chimpanzee and human Y chromosomes are remarkably divergent in structure and gene content
Hughes, J. F., Skaletsky, H., Pyntikova, T., Graves, T. A., van Daalen, S. K. M., Minx, P. J., Fulton, R. S., McGrath, S. D., Locke, D. P., Friedman, C., et al. (2010) · Nature · doi:10.1038/nature08700 · Cited by 409
A taxonomy of suffix array construction algorithms
Puglisi, S. J., Smyth, W. F., & Turpin, A. H. (2007) · ACM Computing Surveys · doi:10.1145/1242471.1242472 · Cited by 312
How to map billions of short reads onto genomes
Trapnell, C., & Salzberg, S. L. (2009) · Nature Biotechnology · doi:10.1038/nbt0509-455 · Cited by 312
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
Kent, W. J., & Zahler, A. M. (2000) · Genome Research · doi:10.1101/gr.10.8.1115 · Cited by 282
Parameters for accurate genome alignment
Frith, M. C., Hamada, M., & Horton, P. (2010) · BMC Bioinformatics · doi:10.1186/1471-2105-11-80 · Cited by 229
Self-citationEPD in its twentieth year: towards complete promoter coverage of selected model organisms
Schmid, C. D. (2005) · Nucleic Acids Research · doi:10.1093/nar/gkj146 · Cited by 132
Incorporating sequence quality data into alignment improves DNA read mapping
Frith, M. C., Wan, R., & Horton, P. (2010) · Nucleic Acids Research · doi:10.1093/nar/gkq010 · Cited by 88
Self-citationThe Genome of Model Malaria Parasites, and Comparative Genomics
Carlton, J. M., Silva, J., & Hall, N. (2005) · Current Issues in Molecular Biology · doi:10.21775/cimb.007.023 · Cited by 75
Stage-dependent Localization of a Novel Gene Product of the Malaria Parasite, Plasmodium falciparum
Nguyen, T. V., Fujioka, H., Kang, A. S., Rogers, W. O., Fidock, D. A., & James, A. A. (2001) · Journal of Biological Chemistry · doi:10.1074/jbc.m103375200 · Cited by 24
Space Efficient Computation of Rare Maximal Exact Matches between Multiple Sequences
Ohlebusch, E., & Kurtz, S. (2008) · Journal of Computational Biology · doi:10.1089/cmb.2007.0105 · Cited by 18
Performing Local Similarity Searches with Variable Length Seeds
Csürös, M. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27801-6_28 · Cited by 16
Cited by
MAFFT Multiple Sequence Alignment Software Version 7: Improvements in Performance and Usability
Katoh, K., & Standley, D. M. (2013) · Molecular Biology and Evolution · doi:10.1093/molbev/mst010 · Cited by 46,209
Unicycler: Resolving bacterial genome assemblies from short and long sequencing reads
Wick, R. R., Judd, L. M., Gorrie, C. L., & Holt, K. E. (2017) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1005595 · Cited by 8,653
Sensitive protein alignments at tree-of-life scale using DIAMOND
Buchfink, B., Reuter, K., & Drost, H.-G. (2021) · Nature Methods · doi:10.1038/s41592-021-01101-x · Cited by 5,097
MMseqs2 enables sensitive protein sequence searching for the analysis of massive data sets
Steinegger, M., & Söding, J. (2017) · Nature Biotechnology · doi:10.1038/nbt.3988 · Cited by 4,840
Reagent and laboratory contamination can critically impact sequence-based microbiome analyses
Salter, S. J., Cox, M. J., Turek, E. M., Calus, S. T., Cookson, W. O., Moffatt, M. F., Turner, P., Parkhill, J., Loman, N. J., & Walker, A. W. (2014) · BMC Biology · doi:10.1186/s12915-014-0087-z · Cited by 3,463
Metadata
- Authors
- Kiełbasa, S. M., Wan, R., Sato, K., Horton, P., & Frith, M. C.
- Venue
- Genome Research
- Publisher
- Cold Spring Harbor Laboratory
- Published
- 2011-01-05
- Volume
- 21
- Issue
- 3
- Pages
- 487-493
- ISSN
- 1088-9051 (ISSN-L)
- OpenAlex
- W2162758337
- Cited by
- 1,281
- References
- 29
- Type
- posted content
- 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.