Skip to content

Commit

Permalink
Small corrections
Browse files Browse the repository at this point in the history
  • Loading branch information
frederic-mahe committed Feb 24, 2016
1 parent e133907 commit 3b9bf54
Show file tree
Hide file tree
Showing 2 changed files with 16 additions and 16 deletions.
32 changes: 16 additions & 16 deletions man/swarm.1
Original file line number Diff line number Diff line change
@@ -1,5 +1,5 @@
.\" ============================================================================
.TH swarm 1 "December 14, 2015" "version 2.1.6" "USER COMMANDS"
.TH swarm 1 "February 24, 2016" "version 2.1.6" "USER COMMANDS"
.\" ============================================================================
.SH NAME
swarm \(em find clusters of nearly-identical nucleotide amplicons
Expand Down Expand Up @@ -29,17 +29,17 @@ repetitions), as it implies unrealistic numbers of pairwise
comparisons. \fBswarm\fR is based on a maximum number of differences
\fId\fR between two amplicons, and focuses only on very close local
relationships. For \fId\fR = 1 (default value), swarm uses an
algorithm of linear complexity that performs exact-string matching by
comparing hash-values. For \fId\fR = 2 or greater, swarm uses an
algorithm of quadratic complexity that performs pairwise string
comparisons. An efficient \fIk\fR-mer-based filtering and an astute
use of comparisons results obtained during the clustering process
allows to avoid most of the amplicon comparisons needed in a naïve
approach. To speed up the remaining amplicon comparisons, \fBswarm\fR
implements an extremely fast Needleman-Wunsch algorithm making use of
the Streaming SIMD Extensions (SSE2) of modern x86-64 CPUs. If SSE2
instructions are not available, \fBswarm\fR exits with an error
message.
algorithm of linear complexity that generates all possible single
mutations and performs exact-string matching by comparing
hash-values. For \fId\fR = 2 or greater, swarm uses an algorithm of
quadratic complexity that performs pairwise string comparisons. An
efficient \fIk\fR-mer-based filtering and an astute use of comparisons
results obtained during the clustering process allows to avoid most of
the amplicon comparisons needed in a naïve approach. To speed up the
remaining amplicon comparisons, \fBswarm\fR implements an extremely
fast Needleman-Wunsch algorithm making use of the Streaming SIMD
Extensions (SSE2) of modern x86-64 CPUs. If SSE2 instructions are not
available, \fBswarm\fR exits with an error message.
.PP
\fBswarm\fR reads the named input \fIfilename\fR, a fasta file of
nucleotide amplicons. The amplicon identifier is defined as the string
Expand Down Expand Up @@ -296,7 +296,7 @@ Torbjørn Rognes <[email protected]>.
The software is available from <https://github.com/torognes/swarm>
.\" ============================================================================
.SH COPYRIGHT
Copyright (C) 2012, 2013, 2014, 2015 Frédéric Mahé & Torbjørn Rognes
Copyright (C) 2012, 2013, 2014, 2015, 2016 Frédéric Mahé & Torbjørn Rognes
.PP
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU Affero General Public License as
Expand Down Expand Up @@ -330,9 +330,9 @@ or minor bug releases are not mentioned):
.RS
.TP
.BR v2.1.6\~ "released December 14, 2015"
Version 2.1.6 fixes problems with older compilers that do not have
the x86intrin.h header file. It also fixes a bug in the output of seeds
with the `-w` option when d>1.
Version 2.1.6 fixes problems with older compilers that do not have the
x86intrin.h header file. It also fixes a bug in the output of seeds
with the `-w` option when \fId\fR > 1.
.TP
.BR v2.1.5\~ "released September 8, 2015"
Version 2.1.5 fixes minor bugs.
Expand Down
Binary file modified man/swarm_manual.pdf
Binary file not shown.

0 comments on commit 3b9bf54

Please sign in to comment.