PreprintCited by 965Algorithms and Data CompressionGenomics and Phylogenetic StudiesFractal and DNA sequence analysis

SSAHA: A Fast Search Method for Large DNA Databases

Open access
Ning, Zemin, Cox, Anthony J., Mullikin, James C.·2001·Genome Research

Abstract

We describe an algorithm, SSAHA (S equence S earch and A lignment by H ashing A lgorithm), for performing fast searches on databases containing multiple gigabases of DNA. Sequences in the database are preprocessed by breaking them into consecutive k-tuples of k contiguous bases and then using a hash table to store the position of each occurrence of each k-tuple. Searching for a query sequence in the database is done by obtaining from the hash table the “hits” for each k-tuple in the query sequence and then performing a sort on the results. We discuss the effect of the tuple length k on the search speed, memory usage, and sensitivity of the algorithm and present the results of computational experiments which show that SSAHA can be three to four orders of magnitude faster than BLAST or FASTA, while requiring less memory than suffix tree methods. The SSAHA algorithm is used for high-throughput single nucleotide polymorphism (SNP) detection and very large scale sequence assembly. Also, it provides Web-based sequence search facilities for Ensembl projects.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1101/gr.194201

Cites

19 of 19 references verified0 citation errors · 0 not checkable

Statistics

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.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • A total of approximately 1.2 million single nucleotide polymorphisms (SNPs) were identified within the 1.84-Gb sequenced female platypus genome using two independent analyses, SSAHA2 and PCAP output.

    “We identified a total of , 1.2 million single nucleotide polymorphisms (SNPs) within the 1.84-Gb sequenced female platypus genomeusing two independent analyses, SSAHA2 (SSAHA: a fast search method for large DNA databases 72 ) and PCAP output 20 (Supplementary Notes 11).”

    From Genome analysis of the platypus reveals unique signatures of evolution (2008) · cites this paper as [72]

    The citation is attached to the method name SSAHA2, not to the platypus SNP count. The Abstract describes SSAHA and its use in SNP detection, but our copy does not identify or describe SSAHA2 specifically (searched: SSAHA2). (LLM, conf=0.84)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Ning, Z., Cox, A. J., & Mullikin, J. C.
Affiliations
Wellcome Sanger Institute (GB)
Venue
Genome Research
Published
2001-10-01
Volume
11
Issue
10
Pages
1725-1729
ISSN
  • 1088-9051 (ISSN-L)
  • 1549-5469
OpenAlex
W2142619120
Cited by
965
References
19
Citations by year
2026: 5 · 2025: 7 · 2024: 13 · 2023: 11 · 2022: 13 · 2021: 24 · 2020: 18 · 2019: 20 · 2018: 25 · 2017: 38 · 2016: 46 · 2015: 56 · 2014: 69 · 2013: 94 · 2012: 95
Type
posted content
Language
en
Open access
Locations
  • Genome Research (publishedVersion)
  • PubMed Central (publishedVersion)
  • PubMed (publishedVersion)
Funders
European Bioinformatics Institute
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Algorithms and Data Compression
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Genomics and Phylogenetic Studies
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Fractal and DNA sequence analysis
Keywords
sequence database searching, DNA databases, hash tables, sequence alignment, memory usage, search speed, BLAST comparison, suffix trees, single nucleotide polymorphism detection, next-generation sequencing, sequence assembly, Ensembl
MeSH terms
Algorithms, Base Composition, Base Sequence, Database Management Systems, DNA, Sensitivity and Specificity, Software, Databases, Factual, Sequence Alignment

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