Tratopedia
繁中
Settings

Text size

Language

Theme

High contrast

Version

v1.230.2

The release this page was built from. It is what the service worker caches under.

Sequence Alignment · Bioinformatics · Analysis Software · ComparisonSources read 17 October 2026

How DNA and protein sequences are lined up

Seven sequence aligners, three jobs

BLASTN, BLAT, LAST, BWA-MEM, Bowtie2, CLUSTALW and Clustal Omega are often listed together as “aligners”, but they answer three different questions. Three of them search for where one sequence resembles another; two place millions of sequencing reads on a reference genome; two line up many related sequences at once. Within each group the differences come down to what is indexed, how the first short matches (the seeds) are chosen, and how confidence is reported. This comparison reads each tool from its own paper, manual and source code, and ends in which tool fits which job.

What is established about each tool, and how firmly Each item with its standing first, read in the tools’ own papers, manuals and source code on 17 October 2026.

  • 3different jobs the seven tools do: local search, read mapping, multiple alignment
  • 399 → 0.1chance hits per 500-base query on a 3-billion-base genome: one 14-mer seed against two 11-mers (Kent, 2002)
  • 19 ntBWA-MEM’s default minimum seed length
  • 190,000+sequences Clustal Omega aligned on one processor in a few hours, in its authors’ 2011 test
StandingWhatRead at
Confirmed: current documentation or codeBLASTN builds its lookup table from the query’s words. The default task is megablast, with 28-base words; the blastn task uses 11, blastn-short 7, and dc-megablast 11 matching positions inside an 18-position template.BLAST+ source code; Camacho et al. 2009
Confirmed: current documentation or codeBLAT indexes the target genome’s non-overlapping 11-mers in memory and, for DNA, starts an alignment on two perfect 11-mer hits. Its default output (PSL) carries scores and identity, not an E-value.Kent 2002; UCSC BLAT specification
Confirmed: current documentation or codeLAST indexes the reference as a suffix array and lengthens each seed until it occurs no more than m times there. It reports E-values and EG, the expected hits per billion query letters.LAST documentation
Confirmed: current documentation or codeBWA-MEM seeds with supermaximal exact matches of at least 19 bases, re-seeds long ones, extends by banded dynamic programming and chooses between local and end-to-end alignment itself. It reports mapping quality (MAPQ).Li 2013; bwa manual
Confirmed: current documentation or codeBowtie2 looks up fixed seeds of 22 bases (20 in local mode) in an FM index of about 3.2 GB for the human genome, extends them with SIMD-accelerated dynamic programming, aligns end-to-end by default and reports MAPQ.Bowtie2 manual; Langmead and Salzberg 2012
Confirmed: the method paperCLUSTALW aligns all pairs to get distances, builds a Neighbour-Joining guide tree, then aligns progressively along it with sequence weights, divergence-dependent matrices and position-specific gap penalties.Thompson, Higgins and Gibson 1994
Confirmed: the method paperClustal Omega builds its guide tree with mBed in O(N log N) time instead of O(N²) and aligns profile hidden Markov models with HHalign.Sievers et al. 2011
Developers’ own benchmarkBLAT “500 times faster” than the mRNA/DNA tools of 2002; adaptive seeds reaching 67% sensitivity in about 10 minutes against 500 for fixed seeds; BWA-MEM about six times as fast as Bowtie2 on 650-base reads; Clustal Omega’s BAliBASE score of 0.554 in 9 minutes.Each tool’s own paper
Sources disagreeBLAT’s minimum DNA query length: the UCSC FAQ says 40 bases or more at 95% similarity; the UCSC Genome Browser User Guide says 25 bases, and that perfect matches of 32 bases, sometimes 22, are found.UCSC BLAT FAQ; UCSC Genome Browser User Guide

What is settled

How each tool indexes, seeds, extends and reports is stated in its own documentation, code or method paper.

What is the developers’ word

Every speed and accuracy figure comes from the tool’s own authors, on the hardware, data and rival tools of 1990 to 2013.

Thirty-six years of aligners Papers dated by their journal issue or posting; releases by the projects’ own records.

  1. 1990Altschul and colleagues publish BLAST, which approximates alignments maximising a local similarity score and attaches statistical significance to them.
  2. 11 Nov 1994Thompson, Higgins and Gibson publish CLUSTAL W: sequence weighting, matrices varied by divergence and position-specific gap penalties.
  3. 1 Sep 1997Gapped BLAST and PSI-BLAST: a new trigger for extending word hits and a gapped-alignment heuristic, about three times the speed of the original for proteins.
  4. Apr 2002Kent publishes BLAT, which indexes the genome rather than the query and stitches exons into gene-level alignments.
  5. 15 Dec 2009Camacho and colleagues describe BLAST+, whose “tasks” set word size and scoring for each kind of search.
  6. Mar 2011Kiełbasa, Frith and colleagues publish adaptive seeds and LAST: seeds chosen by rarity, so run time grows linearly rather than quadratically with sequence length.
  7. 11 Oct 2011Sievers and colleagues publish Clustal Omega: mBed guide trees and HHalign, tested on up to 50,000 sequences.
  8. 4 Mar 2012Langmead and Salzberg publish Bowtie 2: FM-index seeds, then SIMD-accelerated gapped extension.
  9. 2013Shrestha and Frith publish a probabilistic method for paired-end reads, implemented in LAST.
  10. 26 May 2013Li posts version 2 of the BWA-MEM preprint: SMEM seeds, re-seeding, chaining and Z-drop extension, for 70 bases to a few megabases.
  11. 2015Frith and Kawaguchi show split alignment of genomes that gains accuracy by not masking repeats.
  12. 2017Hamada, Frith and colleagues publish last-train, which learns substitution and gap scores from the data being aligned.
  13. 2021Sievers and Higgins’ protocol chapter: Clustal Omega handles many tens of thousands of DNA/RNA or protein sequences.
  14. 22 Mar 2025BWA 0.7.19 released (GitHub, UTC date).
  15. Jul 2025BLAST+ 2.17.0: the release NCBI’s download directory lists as latest, its files dated 1 July.
  16. 16 Feb 2026Bowtie2 2.5.5 released.
  17. 3 Aug 2026LAST tagged as version 1654, the latest in its repository on the day these sources were read.

What cannot be dated. BLAT’s current release, Clustal Omega’s current release and CLUSTALW’s last release: none of the sources read gives a date, and Clustal Omega’s own site refused the request. The tools’ defaults on this page are those of the current documentation and code, not necessarily those of the papers.

Three jobs, and inside each one the index and the seed decide Each source describes only its own tool; the grouping is this article’s reading of them.

  • Search

    Where does this sequence resemble that one?

    BLASTN · BLAT · LAST

    • Local alignment: only the best-matching stretches are reported.
    • BLASTN indexes the query and scans the database; BLAT and LAST index the database and scan the query.
  • Map reads

    Where in this genome did each read come from?

    BWA-MEM · Bowtie2

    • The reference is indexed once with an FM index; millions of reads stream through it.
    • Pairs are handled, and the answer comes with a mapping quality.
  • Align many

    How do all these related sequences line up together?

    CLUSTALW · Clustal Omega

    • No index and no seeds: distances give a guide tree, and sequences join along it.
    • Every position of every sequence is placed, end to end.
ToolWhat is indexedSeed
BLASTNThe query’s words, in a lookup table; the database is scannedExact words: 28 bases (megablast, default), 11 (blastn), 7 (blastn-short); spaced in dc-megablast
BLATNon-overlapping 11-mers of the target genome, held in memoryTwo perfect 11-mer hits on one diagonal (DNA)
LASTA suffix array of the referenceAdaptive: each seed lengthened until it occurs at most m times
BWA-MEMFM index of the referenceSupermaximal exact matches, at least 19 bases; long ones re-seeded
Bowtie2FM index of the referenceFixed exact seeds of 22 bases (20 in local mode), spaced by read length
CLUSTALWNothing; all pairs are aligned for distancesNone; a Neighbour-Joining guide tree instead
Clustal OmegaNothing; each sequence becomes a short vector of distances (mBed)None; a clustered guide tree instead

Why the seed rule matters. A seed is a short exact match found quickly through an index; only seeded regions get the expensive alignment step, so the seed rule sets both the speed and what is missed. Kent worked the arithmetic for BLAT in 2002: to find 99% of 100-base regions at 95% identity, a single perfect seed must be 14 bases or shorter, and against a 3-billion-base genome that passes 399 chance regions per 500-base query to alignment; two perfect 11-mers pass 0.1. LAST’s answer is different: rather than fixing the length, it lengthens each seed until it is rare. Its developers measured 777 million matches with adaptive seeds between the human and mouse X chromosomes, against 22 billion for fixed 13-base seeds, and argued that adaptive seeds give the sensitivity of a 13-base seed at the run time of a 32-base one.

  • 399chance regions, one 14-mer seed
  • 0.1chance regions, two 11-mer seeds

A reading

Reading. The first decision is the job, not the tool. Within search, the trade-off between speed and sensitivity is set mostly by the seed; within read mapping, by how seeds are found and extended in an FM index; within multiple alignment, by how the guide tree is built.

Extension, scoring and what the numbers mean From each tool’s current manual or code where one exists, otherwise its method paper.

ToolExtensionDefault scoringConfidence reportedTypical input
BLASTNUngapped, then gapped X-dropblastn +2/−3, gaps 5 + 2 per base; megablast +1/−2, linear gaps; low-complexity filter onE-value and bit score (default cut-off 10)A query against a database
BLATAlign the clumped regions, stitch the blocks, revisit small exons and splice sitesMatches minus mismatches minus a gap penalty; minimum score 30, minimum identity 90%Score and identity; no E-value in the default outputmRNA or DNA up to 200,000 bases
LASTGapless, then gapped X-drop from a coreA matrix or match/mismatch scores, or scores learnt by last-train; gaps a + b·kE and EG; by default, matches expected by chance at most once per million query lettersReads to whole genomes
BWA-MEMBanded affine-gap dynamic programming with Z-drop; mate rescueMatch 1, mismatch 4, gap open 6, extension 1, clipping 5Mapping quality (MAPQ)70 bases to a few megabases
Bowtie2SIMD-accelerated dynamic programmingEnd-to-end: mismatch up to 6 by base quality, read gap 5 + 3 per base; local mode adds a match bonus of 2Mapping quality (MAPQ)Reads of about 50 to a few hundred bases
CLUSTALWFull profile-to-profile dynamic programming at each tree nodeMatrices varied by divergence; residue- and position-specific gap penaltiesNone per alignmentSmall sets of related sequences
Clustal OmegaProfile hidden Markov model against profile HMM (HHalign) at each nodeProfile HMMs; an external profile can guide the alignmentNone per alignmentTens of thousands of DNA, RNA or protein sequences

An E-value and a MAPQ answer different questions. BLASTN and LAST report how often a score this good would arise between random sequences of the same lengths, which suits a search where any hit might be chance. BWA-MEM and Bowtie2 report a Phred-scaled estimate of how likely the read has been placed in the wrong spot, which suits a read assumed to come from the genome that may fit several places. BLAT’s default output gives match counts and identity, suited to near-identical placement. The multiple aligners report no per-alignment figure at all: their quality is judged on benchmark sets, which their own authors call “heavily biased toward single domain globular proteins”. None of these converts into another.

Repeats, memory and long reads. BLAT leaves overly frequent 11-mers out of its index; its server index takes about 1 GB for unmasked DNA. LAST’s adaptive seeds let genomes be compared with little or no repeat masking, though its authors still advise masking simple repeats; its split alignment of genomes “gains accuracy by not masking repeats”. Its index grows with the seeding scheme: the most sensitive, MAM8, needs about 50 GB for a mammal genome, while the RY schemes cut time and memory by seeding at only some positions. For long reads with many insertion and deletion errors, LAST’s own cookbook trains parameters with last-train and then keeps one best alignment per part of each read; last-train’s authors report better accuracy for reads from three sequencing platforms and less reference bias for nanopore reads. BWA-MEM covers 70 bases to megabases; its author found seeding the bottleneck for short reads and banded alignment for long ones. Bowtie2’s FM index of the human genome uses about 3.2 GB.

  • ~1 GBBLAT server index, unmasked DNA
  • ~3.2 GBBowtie2 index, human genome
  • ~50 GBLAST with MAM8 seeds, mammal genome

Benchmarks of their day

BLAT’s 500-fold speed-up was against tools of 2002; Bowtie2’s 2012 memory comparison was with the original BWA, a year before BWA-MEM; BWA-MEM’s sixfold lead over Bowtie2 was on 650-base reads, and the two were similar on 100-base reads. Each figure is its authors’ own.

Clustal Omega against the consistency methods

On BAliBASE its authors measured 0.554 of columns correct in 9 minutes; consistency-based programs such as Probcons and T-Coffee reached 0.55 to 0.61 in 25 minutes to 22 hours, and Clustal W was the weakest program tested.

Which tool suits which job One card per tool: who it is for, what it is best at, and the trade-off.

  • BLASTN

    Finding related sequences in a database, with a statistic attached

    Best at: E-values for every hit, and presets from near-identical (megablast) to cross-species (dc-megablast) and short queries.

    • The default task is the near-identical one; divergent DNA needs blastn or dc-megablast chosen on purpose.
    • Trade-off: scanning the database for every query is slow at the scale of whole genomes or millions of reads.
  • BLAT

    Placing an mRNA, cDNA or sequence on its own species’ genome

    Best at: speed on near-identical sequence, and spliced alignments that show exon structure in one result.

    • Designed for DNA at 95% similarity or more, and protein at 80% or more.
    • Trade-off: it misses divergent matches, short sequences that span a splice site, and gives no E-value by default.
  • LAST

    Comparing whole genomes, or reads whose error profile is unknown

    Best at: repeat-rich or compositionally unusual genomes, and parameters learnt from the data itself.

    • Adaptive seeds, split alignment, E-values, and DNA-to-protein as well as DNA-to-DNA.
    • Trade-off: memory grows with the seeding scheme, and pairing is a separate step rather than built in.
  • BWA-MEM

    Mapping reads or contigs from 70 bases to megabases

    Best at: one tool across read lengths, choosing local or end-to-end alignment itself and reporting chimeric reads.

    • Paired reads are rescued and scored using the insert-size distribution.
    • Trade-off: it answers where a read belongs, not how significant a match is; its speed lead in its author’s test was on long reads.
  • Bowtie2

    Mapping short reads to a large genome

    Best at: short reads of about 50 to a few hundred bases in a modest memory footprint, with explicit end-to-end or local modes and presets.

    • Concordant, discordant and mixed pairing, with quality-aware scoring.
    • Trade-off: built for reads up to a few hundred bases; on 650-base reads BWA-MEM’s author measured it about six times slower than his tool.
  • CLUSTALW

    Reproducing an older analysis, or teaching progressive alignment

    Best at: a transparent, well-documented progressive method with hand-tuned gap rules.

    • Its method and its gap rules are set out in full in its 1994 paper.
    • Trade-off: weakest on its successor’s benchmark, O(N²) to build the tree, and unreliable when every pair is below about 25–30% identity.
  • Clustal Omega

    Multiple alignment at any size, from a handful to tens of thousands

    Best at: scale, with accuracy its authors measured as close to the slow consistency methods, and the option to align against an external profile.

    • Handles DNA, RNA and protein; iteration helps most near 1,000 sequences and above.
    • Trade-off: on BAliBASE, whose test sets are mostly small, the best consistency methods scored somewhat higher (up to 0.61 against 0.554), at far greater run time.

Hold loosely

Defaults change between versions; these are the defaults of the documentation and code read on 17 October 2026. Every speed figure is the developers’ own, from 1990 to 2013, and no independent benchmark of all seven was found.

  • Reading. Short reads onto a reference genome: BWA-MEM or Bowtie2; both need the reference indexed first.
  • Reading. Longer reads or assembled contigs: BWA-MEM; for long reads with many indel errors, LAST with last-train.
  • Reading. An mRNA or cDNA on its own species’ genome at high identity: BLAT.
  • Reading. Divergent homologues that need an E-value: BLASTN with the blastn or dc-megablast task.
  • Reading. Whole genomes, especially repeat-rich ones: LAST.
  • Reading. Multiple alignment: Clustal Omega; CLUSTALW where an older result must be reproduced.

Quick notes

  1. Sequence alignment · sources read 17 October 2026

    Sequence aligners explained

    LAST · CLUSTALW · Clustal Omega · BWA-MEM · Bowtie2 · BLASTN · BLAT

    Alignment strategies compared1 / 15

  2. Overview

    Three jobs, seven tools

    This article’s grouping; each tool’s documentation describes only itself.

    • Search

      Find where a sequence matches a database or genome

      • BLASTN · BLAT · LAST
    • Map reads

      Place millions of sequencing reads on a reference genome

      • BWA-MEM · Bowtie2
    • Align many

      Line up many related sequences in one alignment

      • CLUSTALW · Clustal Omega

    Seven sequence aligners · sources read 17 October 20262 / 15

  3. Basics

    Alignment in one picture

    Query ACGTTGCAAT against reference ACCTTGCGAT: 8 of 10 positions match, which is 80% identity.

    • Local

      Only the best-matching stretch is reported

      • BLASTN and LAST work this way.
    • End-to-end

      Every position counts

      • Bowtie2’s default; the Clustal tools align full length.
    • Gaps

      An insertion or deletion costs an opening plus an extension penalty

      • Called affine gap costs.

    Seven sequence aligners · sources read 17 October 20263 / 15

  4. Basics

    Seed, then extend

    BLASTN, BLAT, LAST, BWA-MEM and Bowtie2 follow this pattern and differ mostly in the seed step. CLUSTALW and Clustal Omega build a guide tree instead.

    1. 1SeedFind a short exact match through an index
    2. 2ChainGroup seeds that line up
    3. 3ExtendGrow each seed with dynamic programming
    4. 4ScoreKeep alignments that score high enough

    Seven sequence aligners · sources read 17 October 20264 / 15

  5. Seeds

    Seeds at a glance

    Longer seeds run faster but miss weak matches; shorter seeds catch more and cost more time.

    ToolSeedIndex
    BLASTNExact words: 28 bases (megablast, default), 11 (blastn)Query word table
    BLATTwo perfect 11-mers on one diagonalGenome 11-mers in memory
    LASTAdaptive: grown until rareSuffix array
    BWA-MEMSupermaximal exact matches, at least 19 basesFM index
    Bowtie2Fixed, 22 bases (20 in local mode)FM index

    Seven sequence aligners · sources read 17 October 20265 / 15

  6. Search · 1 of 3

    BLASTN

    Fixed word seeds, X-drop extension, and an E-value for every hit

    1. 1Cut the query into words28 bases (megablast) or 11 (blastn)
      queryGATCCTAGGCTTACGATCCTAGGCT1ATCCTAGGCTT2TCCTAGGCTTA3CCTAGGCTTAC4

      14 bases give 14 − 11 + 1 = 4 words of 11, each filed in the lookup table under its query position (blastn task).

    2. 2Extend each hitUngapped X-drop, then gapped
      queryGATCCTAGGCTTACGATGCAsubjectGATCCTAGGCTCACGTCCAG

      N seedN matchN mismatchN dropped

      +2 a match, −3 a mismatch. The best score, 25, is reached after 15 bases; at 19 the score is more than X = 5 below it, so the extension stops and is cut back to 15. X here is a toy value.

    3. 3Score and rankKarlin–Altschul statistics give E-values
      HitMatch / mismatchScore
      A14 / 125
      B13 / 123
      C11 / 022

      Each hit scored +2/−3. An E-value counts the chance hits expected to score at least as well, so it falls as the score rises and the ranking is the same. Hits with E above 10 are not reported.

    FactValue
    IndexQuery word lookup table
    SeedsExact words of 11 or 28 bases; 7 for short queries
    ConfidenceE-value and bit score
    Best forDivergent DNA, with statistics

    Seven sequence aligners · sources read 17 October 20266 / 15

  7. Search · 2 of 3

    BLAT

    Index the genome, scan the query: fast placement of near-identical sequence

    1. 1Index the genomeNon-overlapping 11-mers held in memory
      genomeTGGACCTAGCAATCGGTACCATTGGACCTAGCA1ATCGGTACCAT12

      22 bases of genome go into the index as 2 non-overlapping 11-mers, not as the 22 − 11 + 1 = 12 overlapping ones. The number is where each starts.

    2. 2Require two hitsTwo perfect 11-mers on one diagonal
      CTGGACCTAGCAATCGGTACCATGTGGACCTAGCA−1ATCGGTACCAT−1

      N seed

      Every 11-mer of the query, the top row, is looked up. Two hit the index, both on diagonal −1 (genome position minus query position), so the region goes on to be aligned.

    3. 3Stitch the blocksExons joined into gene-level alignments, splice sites adjusted
      genomeATGCCAGTAAGCAGGTTCGAmRNAATGCCA--------GTTCGA

      N match- gap

      Two 6-base blocks are joined across an 8-base gap; the gap’s GT…AG ends fit a canonical splice site.

    FactValue
    IndexGenome 11-mers in memory (about 1 GB)
    SeedsTwo perfect 11-mer hits
    ConfidenceScore and identity; no E-value in the default output
    Best formRNA on a genome at 95%+; UCSC pages quote a minimum of 25 or 40 bases

    Seven sequence aligners · sources read 17 October 20267 / 15

  8. Search · 3 of 3

    LAST

    Adaptive seeds, for repeat-rich genomes and whole-genome comparison

    1. 1Build a suffix arraylastdb indexes the reference once
      ACG5ACGTACG1CG6CGTACG2G7GTACG3TACG4

      The 7 suffixes of the reference ACGTACG, sorted. The number is where each starts; one lookup finds every suffix that begins with a given seed.

    2. 2Grow adaptive seedsEach seed lengthens until it is rare in the reference
      queryACGTTCA
      LengthSeedOccurs
      1A2
      2AC2
      3ACG2
      4ACGT1

      N seed

      The seed grows a letter at a time until it occurs at most m = 1 times in the reference: a 4-letter seed. m here is a toy value.

    3. 3Extend, then learnGapless then gapped X-drop; last-train learns rates from the data
      ref.TCACGTTGGATCAAqueryTGACGTTGGA-CTA

      N seedN matchN mismatch- gap

      The core, the longest identical run (8 letters), seeds a gapped extension to either side. Its 2 substitutions and 1 deletion are the kind of difference last-train learns rates from.

    FactValue
    IndexSuffix array (lastdb)
    SeedsAdaptive, grown until rare
    ConfidenceE-value and EG (expected hits per billion query letters)
    Best forRepeat-rich or divergent genomes

    Seven sequence aligners · sources read 17 October 20268 / 15

  9. Map reads · 1 of 2

    BWA-MEM

    Maximal exact matches as seeds; local or end-to-end chosen automatically

    1. 1Find maximal exact matchesSMEMs of at least 19 bases; long ones re-seeded
      ref.ACGTTAGCCATGGACTTGCAATreadACGTTAGCCATGGACTTGCAGTACGTTAGCCATGGACTTGCA20AG2GT2

      N seedN matchN mismatchN dropped

      3 SMEMs cover the read; the number is each one’s length. Only the 20-base SMEM reaches the minimum of 19 and becomes a seed; none is over 28, so none is re-seeded.

    2. 2Chain and extendBanded affine-gap dynamic programming with Z-drop
      SeedReadRef.Length
      A1–20101–12020
      B22–45121–14424
      C27–455001–501919

      A and B lie in order on read and reference: one chain. Its one extra read base is a gap costing 6 + 1 = 7, so with 1 per match it scores 44 − 7 = 37. C’s chain sits inside that read span and scores 19, so it is filtered out.

    3. 3Pair and reportMates rescued within the insert-size range; MAPQ output
      WindowBases
      μ ± 4σ200–400

      With an insert mean μ of 300 and spread σ of 25 (toy values), an unmapped mate is searched for within 200–400: one at 350 is rescued, one at 450 is not. MAPQ is Phred-scaled: 30 means a 1 in 1,000 chance the read is placed wrong.

    FactValue
    IndexFM index (bwa index)
    SeedsSMEMs, at least 19 bases
    ConfidenceMapping quality (MAPQ)
    Best forReads or contigs from 70 bases to megabases

    Seven sequence aligners · sources read 17 October 20269 / 15

  10. Map reads · 2 of 2

    Bowtie2

    Several fixed-length seeds, then SIMD-accelerated extension

    1. 1Pick seeds from the read22 bases (20 in local mode), from the read and its reverse complement
      readTTGCATCCTAAGTCTAGCTTGATTGCATCCTA1CCTAAGTCTA7TCTAGCTTGA13

      Seeds of 10 every 6 bases (toy values) give 3 from a 22-base read, and 3 more from its reverse complement. By default a seed is 22 bases (20 in local mode), taken every 1 + 1.15√L bases of an L-base read.

    2. 2Look them upThe FM index finds exact, ungapped hits
      ref.TTGCATCCGAAGTCTAGCTTGATTGCATCCTA0CCTAAGTCTA0TCTAGCTTGA1

      N seedN matchN mismatch

      A seed must match exactly (-N 0); the number is its hits. The mismatch at base 9 breaks seeds 1 and 2, and seed 3 finds its 1 hit.

    3. 3Extend with SIMDPrioritised hits get SIMD-accelerated dynamic programming
      ModeScoreMinimum
      End-to-end−17−30.6
      Local8151.3

      A 50-base read with one mismatch (−6) and one 2-base gap (−11). End-to-end starts from 0; local adds +2 for each of the 49 matching bases. Both clear their minimum, −0.6 − 0.6L and 20 + 8 ln L.

    FactValue
    IndexFM index (about 3.2 GB for the human genome)
    SeedsFixed, 20–22 bases, no mismatches
    ConfidenceMapping quality (MAPQ)
    Best forReads of about 50 to a few hundred bases

    Seven sequence aligners · sources read 17 October 202610 / 15

  11. Align many · 1 of 2

    CLUSTALW

    The classic progressive multiple alignment

    1. 1Measure distancesEvery pair aligned, by k-tuples or full alignment
      AGATTACAGCABGATTACTGCACGACTTCAGGADGACTTCTGGT
      ABC
      B0.1
      C0.30.4
      D0.50.40.2

      Distance is 1 − identity: A and B differ at 1 of 10 positions, so 0.1.

    2. 2Build a guide treeNeighbour-Joining orders the sequences
      ABCD

      Neighbour-Joining on those distances pairs A with B and C with D; the root goes at the mid-point of the longest path.

    3. 3Align along the treeWeighted profiles, position-specific gap penalties
      AGATTACAGCA1BGATTACTGCA1CGACTTCAGGA2DGACTTCTGGT2

      N match

      Joined in the tree’s order: 1 A with B, 2 C with D, then 3 the two profiles with each other.

    FactValue
    IndexNone (all-pairs distances)
    SeedsNone (a distance tree instead)
    ConfidenceNone
    Best forSmall sets, teaching, reproducing older work

    Seven sequence aligners · sources read 17 October 202611 / 15

  12. Align many · 2 of 2

    Clustal Omega

    Scalable multiple alignment, profile HMM against profile HMM

    1. 1Embed the sequencesmBed: distances to about log N reference sequences
      S1GATTCAGC0, 0.5S2GATTCTGC0.29, 0.5S3GACTCAGC0.29, 0.33S4GTCTAGC0.5, 0S5GTCTATC0.67, 0.33S6GTCTAGG0.67, 0.17

      Each sequence becomes its distances to n = 2 reference sequences, S1 and S4: 6 × 2 = 12 distances instead of all 15 pairs. The distance here is the share of 2-letter words not in common, a toy measure.

    2. 2Cluster into a treeK-means or UPGMA, O(N log N)
      S1S2S3S4S5S6

      UPGMA on those vectors puts S1–S3 in one group and S4–S6 in the other.

    3. 3Align HMM to HMMHHalign at each node; iteration optional
      S1GATTCAGCS2GATTCTGCS3GACTCAGCS4GTCT-AGCS5GTCT-ATCS6GTCT-AGG

      - gap

      Each group is a profile; the two are aligned column to column, and a gap opens at column 5 of the second.

    FactValue
    IndexNone (mBed vectors)
    SeedsNone (a clustered tree instead)
    ConfidenceNone
    Best forSmall to very large sets; over 190,000 sequences in its authors’ test

    Seven sequence aligners · sources read 17 October 202612 / 15

  13. Side by side

    Seven tools, side by side

    MAPQ is a mapping-quality score, not an E-value.

    ToolJobIndexSeedConfidence
    BLASTNSearchQuery word tableExact word, 11 or 28E-value
    BLATSearchGenome 11-mers in memoryTwo 11-mersScore, identity
    LASTSearchSuffix arrayAdaptiveE-value, EG
    BWA-MEMMap readsFM indexSMEM, 19+MAPQ
    Bowtie2Map readsFM indexFixed, 20–22MAPQ
    CLUSTALWAlign manyNoneNoneNone
    Clustal OmegaAlign manyNoneNoneNone

    Seven sequence aligners · sources read 17 October 202613 / 15

  14. Choosing

    Which one should I use?

    Readings from the comparison, not rankings.

    Your situationSuggested tool
    Short reads, about 50 to a few hundred basesBWA-MEM / Bowtie2
    Long reads or assembled contigsBWA-MEM, or LAST with last-train
    mRNA on its own genome at 95%+ identityBLAT
    Divergent homologues that need E-valuesBLASTN
    Whole genomes with many repeatsLAST
    Multiple alignment of many sequencesClustal Omega

    Seven sequence aligners · sources read 17 October 202614 / 15

  15. Take-aways

    Pick the job first, then the tool

    • Search tools differ mostly in their seeds.
    • Read mappers index the reference once, then stream reads through it.
    • For multiple alignment, Clustal Omega over CLUSTALW, unless older work must be reproduced.

    Hold loosely

    Defaults change between versions, and every speed figure is the developers’ own, from 1990 to 2013.

    Seven sequence aligners · sources read 17 October 202615 / 15

  • W. J. Kent, BLAT (Genome Research, 2002, PMC)
  • S. M. Kiełbasa and colleagues, adaptive seeds (Genome Research, 2011, PMC)
  • LAST documentation (lastal, E-values, seeding schemes, lastdb, last-train, cookbook) and repository tags, GitLab
  • M. Hamada and colleagues, last-train (Bioinformatics, 2017, PubMed)
  • A. M. Shrestha and M. C. Frith, paired-end reads (Bioinformatics, 2013, PubMed)
  • M. C. Frith and R. Kawaguchi, split alignment (Genome Biology, 2015, PMC)
  • H. Li, BWA-MEM (arXiv, 2013), bwa manual page and release 0.7.19, GitHub
  • Bowtie 2 manual and NEWS, GitHub
  • B. Langmead and S. L. Salzberg, Bowtie 2 (Nature Methods, 2012, PMC)
  • S. F. Altschul and colleagues, BLAST (Journal of Molecular Biology, 1990, PubMed) and gapped BLAST (Nucleic Acids Research, 1997)
  • C. Camacho and colleagues, BLAST+ (BMC Bioinformatics, 2009, PMC)
  • NCBI C++ Toolkit BLAST source code, GitHub
  • NCBI BLAST+ download directory
  • UCSC Genome Browser, BLAT FAQ, BLAT specification and User Guide
  • J. D. Thompson, D. G. Higgins and T. J. Gibson, CLUSTAL W (Nucleic Acids Research, 1994)
  • F. Sievers and colleagues, Clustal Omega (Molecular Systems Biology, 2011, PMC)
  • F. Sievers and D. G. Higgins, the Clustal Omega package (Methods in Molecular Biology, 2021, PubMed). Read 17 October 2026.

Versions

This document is rewritten when what it says has to change. Every version stays published at its own address.

  1. v0002 current
  2. v0001 superseded

The current version is also at latest/.