File: spoa.1

package info (click to toggle)
spoa 4.1.5-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 464 kB
  • sloc: cpp: 4,552; makefile: 32; sh: 10
file content (63 lines) | stat: -rw-r--r-- 1,402 bytes parent folder | download | duplicates (5)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
.TH SPOA "1" "June 2018" "spoa 1.1.3" "User Commands"
.SH NAME
spoa \- SIMD partial order alignment tool
.SH SYNOPSIS
.B spoa
[options ...] <sequences>
.SH DESCRIPTION
Spoa (SIMD POA) is a c++ implementation of the partial order alignment
(POA) algorithm (as described in 10.1093/bioinformatics/18.3.452) which
is used to generate consensus sequences (as described in
10.1093/bioinformatics/btg109). It supports three alignment modes: local
(Smith-Waterman), global (Needleman-Wunsch) and semi-global alignment
(overlap).
.SH OPTIONS
.HP
<sequences>
.IP
input file in FASTA/FASTQ format containing sequences
.IP
.SS Optional
.HP
\fB\-m\fR, \fB\-\-match\fR <int>
.IP
default: 5
score for matching bases
.HP
\fB\-x\fR, \fB\-\-mismatch\fR <int>
.IP
default: \fB\-4\fR
score for mismatching bases
.HP
\fB\-g\fR, \fB\-\-gap\fR <int>
.IP
default: \fB\-8\fR
gap penalty (must be negative)
.HP
\fB\-l\fR, \fB\-\-algorithm\fR <int>
.IP
default: 0
alignment mode:
.IP
0 \- local (Smith\-Waterman)
1 \- global (Needleman\-Wunsch)
2 \- semi\-global
.HP
\fB\-r\fR, \fB\-\-result\fR <int>
.IP
default: 0
result mode:
.IP
0 \- consensus
1 \- multiple sequence alignment
2 \- 0 & 1
.HP
\fB\-\-version\fR
.IP
prints the version number
.HP
\fB\-h\fR, \fB\-\-help\fR
.IP
prints the usage
.SH AUTHOR
This manpage was written by Andreas Tille for the Debian distribution and can be used for any other usage of the program.