.\" DO NOT MODIFY THIS FILE!  It was generated by help2man 1.47.12.
.TH IDBA "1" "March 2020" "idba 1.1.3" "User Commands"
.SH NAME
idba \- Iterative de Bruijn Graph Assembler
.SH SYNOPSIS
.B idba_ud
\fI\,-r read.fa -o output_dir\/\fR
.SH DESCRIPTION
IDBA\- Iterative de Bruijn Graph Assembler.
.SS "Allowed Options:"
.TP
\fB\-o\fR, \fB\-\-out\fR arg (=out)
output directory
.TP
\fB\-r\fR, \fB\-\-read\fR arg
fasta read file (<=128)
.TP
\fB\-\-read_level_2\fR arg
paired\-end reads fasta for second level scaffolds
.TP
\fB\-\-read_level_3\fR arg
paired\-end reads fasta for third level scaffolds
.TP
\fB\-\-read_level_4\fR arg
paired\-end reads fasta for fourth level scaffolds
.TP
\fB\-\-read_level_5\fR arg
paired\-end reads fasta for fifth level scaffolds
.TP
\fB\-l\fR, \fB\-\-long_read\fR arg
fasta long read file (>128)
.TP
\fB\-\-mink\fR arg (=20)
minimum k value (<=124)
.TP
\fB\-\-maxk\fR arg (=50)
maximum k value (<=124)
.TP
\fB\-\-step\fR arg (=10)
increment of k\-mer of each iteration
.TP
\fB\-\-prefix\fR arg (=3)
prefix length used to build sub k\-mer table
.TP
\fB\-\-min_count\fR arg (=2)
minimum multiplicity for filtering k\-mer when building the graph
.TP
\fB\-\-min_support\fR arg (=1)
minimum supoort in each iteration
.TP
\fB\-\-num_threads\fR arg (=0)
number of threads
.TP
\fB\-\-seed_kmer\fR arg (=30)
seed kmer size for alignment
.TP
\fB\-\-min_contig\fR arg (=200)
minimum size of contig
.TP
\fB\-\-similar\fR arg (=0.95)
similarity for alignment
.TP
\fB\-\-max_mismatch\fR arg (=3)
max mismatch of error correction
.TP
\fB\-\-min_pairs\fR arg (=3)
minimum number of pairs
.TP
\fB\-\-no_coverage\fR
do not iterate on coverage
.TP
\fB\-\-no_correct\fR
do not do correction
.TP
\fB\-\-pre_correction\fR
perform pre\-correction before assembly
.SH AUTHOR
 This manpage was written by Andreas Tille for the Debian distribution and
 can be used for any other usage of the program.