RAZERS3(1)
π RAZERS3(1) β the razers3 page, bestie edition π
okay so. section 1, general commands. this is razers3, and no cap, it's about to be your new favorite read mapper. let's go π¦
β¨ NAME β¨
razers3 β Faster, fully sensitive read mapping π§¬π
πΈ SYNOPSIS πΈ
razers3 [OPTIONS] <GENOME FILE> <READS FILE>
razers3 [OPTIONS] <GENOME FILE> <PE-READS FILE1> <PE-READS FILE2>
π DESCRIPTION π
RazerS 3 ate and left no crumbs: it's a versatile, full-sensitive read mapper built on k-mer counting and seeding filters. It does single-end and paired-end mapping, it does shared-memory parallelism, and the way it optimally parametrizes the filter based on a minimal sensitivity you pick yourself? iconic. genuinely iconic. go look at https://www.seqan.de/apps/razers3 for more, iykyk π
What you feed it: a reference genome file, plus either one file of single-end reads or two files holding the left and right mates of paired-end reads. And here's a cute trick β pass - and it reads single-end reads straight from stdin π
(c) Copyright 2009-2026 by David Weese.
π REQUIRED ARGUMENTS π
ARGUMENT 0INPUT_FILE β this is your reference genome file, periodt. Valid filetypes are:.sam[.*],.raw[.*],.gbk[.*],.frn[.*],.fq[.*],.fna[.*],.ffn[.*],.fastq[.*],.fasta[.*],.fas[.*],.faa[.*],.fa[.*],.embl[.*], and.bam, where*is any of these extensions:gz,bz2, andbgzfβ those give you transparent (de)compression, slay π₯READSList of INPUT_FILE's β either one file (single-end) or two files (paired-end) of reads. Valid filetypes are:.sam[.*],.raw[.*],.gbk[.*],.frn[.*],.fq[.*],.fna[.*],.ffn[.*],.fastq[.*],.fasta[.*],.fas[.*],.faa[.*],.fa[.*],.embl[.*], and.bam, where*is any of these extensions:gz,bz2, andbgzffor transparent (de)compression π
β¨ OPTIONS β¨
-h,--helpβ display the help message. bestie behavior, always read the help π«Ά--versionβ display version information. who even are you (affectionate)
π Main Options π
-i,--percent-identity DOUBLEβ percent identity threshold. in range[50..100]. default:95.-rr,--recognition-rate DOUBLEβ percent recognition rate. in range[80..100]. default:100.-ng,--no-gapsβ allow only mismatches, no indels. default: allow both.-f,--forwardβ map reads only to forward strands.-r,--reverseβ map reads only to reverse strands.-m,--max-hits INTEGERβ output only<NUM>of the best hits. in range[1..inf]. default:100.--uniqueβ output only unique best matches. that's literally-m 1 -dr 0 -pabtw, cute lil shorthand β¨-tr,--trim-reads INTEGERβ trim reads to given length. default: off. in range[14..inf].-o,--output OUTPUT_FILEβ mapping result filename (use-to dump to stdout in razers format). default:<READS FILE>.razers. valid filetypes are:.sam,.razers,.gff,.fasta,.fa,.eland,.bam, and.afg.-v,--verboseβ verbose mode.-vv,--vverboseβ very verbose mode. it's giving main character energy π
π Paired-end Options π
-ll,--library-length INTEGERβ paired-end library length. in range[1..inf]. default:220.-le,--library-error INTEGERβ paired-end library length tolerance. in range[0..inf]. default:50.
π Output Format Options π
-a,--alignmentβ dump the alignment for each match (only razer or fasta format).-pa,--purge-ambiguousβ purge reads with more than<max-hits>best matches.-dr,--distance-range INTEGERβ only consider matches with at mostNUMmore errors compared to the best. default: output all.-gn,--genome-naming INTEGERβ select how genomes are named (see Naming section below, bestie π). in range[0..1]. default:0.-rn,--read-naming INTEGERβ select how reads are named (see Naming section below). in range[0..3]. default:0.--full-readidβ use the whole read id (don't clip after whitespace). no shortening, no gatekeeping π-so,--sort-order INTEGERβ select how matches are sorted (see Sorting section below). in range[0..1]. default:0.-pf,--position-format INTEGERβ select begin/end position numbering (see Coordinate section below). in range[0..1]. default:0.-ds,--dont-shrink-alignmentsβ disable alignment shrinking in SAM. β οΈ this is required for generating a gold mapping for Rabema. don't skip it.
π§ Filtration Options π§
-fl,--filter STRINGβ select k-mer filter. one ofpigeonholeandswift. default:pigeonhole.-mr,--mutation-rate DOUBLEβ set the percent mutation rate (pigeonhole). in range[0..20]. default:5.-ol,--overlap-length INTEGERβ manually set the overlap length of adjacent k-mers (pigeonhole). in range[0..inf].-pd,--param-dir STRINGβ read user-computed parameter files in the directory<DIR>(swift).-t,--threshold INTEGERβ manually set minimum k-mer count threshold (swift). in range[1..inf].-tl,--taboo-length INTEGERβ set taboo length (swift). in range[1..inf]. default:1.-s,--shape STRINGβ manually set k-mer shape.-oc,--overabundance-cut INTEGERβ set k-mer overabundance cut ratio. in range[0..1]. default:1.-rl,--repeat-length INTEGERβ skip simple-repeats of length<NUM>. in range[1..inf]. default:1000.-lf,--load-factor DOUBLEβ set the load factor for the open addressing k-mer index. in range[1..inf]. default:1.6.
π¦ Verification Options π¦
-mN,--match-NβNmatches all other characters. default:Nmatches nothing.-ed,--error-distr STRINGβ write error distribution toFILE.-mf,--mismatch-file STRINGβ write mismatch patterns toFILE.
π Misc Options π
-cm,--compact-mult DOUBLEβ multiply compaction threshold by this value after reaching and compacting. in range[0..inf]. default:2.2.-ncf,--no-compact-frac DOUBLEβ don't compact if in this last fraction of genome. in range[0..1]. default:0.05.
β‘ Parallelism Options β‘
-tc,--thread-count INTEGERβ set the number of threads to use (0to force sequential mode). in range[0..inf]. default:1.-pws,--parallel-window-size INTEGERβ collect candidates in windows of this length. in range[1..inf]. default:500000.-pvs,--parallel-verification-size INTEGERβ verify candidates in packages of this size. in range[1..inf]. default:100.-pvmpc,--parallel-verification-max-package-count INTEGERβ largest number of packages to create for verification perthread-1. in range[1..inf]. default:100.-amms,--available-matches-memory-size INTEGERβ bytes of main memory available for storing matches. in range[-1..inf]. default:0.-mhst,--match-histo-start-threshold INTEGERβ when to start histogram. in range[1..inf]. default:5.
π FORMATS, NAMING, SORTING, AND COORDINATE SCHEMES π
RazerS 3 supports various output formats, and the way it knows which one you want is vibe check on the file name suffix β automatic, no cap.
.razersβ Razer format.fa,.fastaβ Enhanced Fasta format.elandβ Eland format.gffβ GFF format.samβ SAM format.bamβ BAM format.afgβ Amos AFG format
By default, reads and contigs are referred by their Fasta ids given in the input files. With the -gn and -rn options this behaviour can be changed:
0β use Fasta id.1β enumerate beginning with 1.2β use the read sequence (only for short reads!).3β use the Fasta id, do NOT append/Lor/Rfor mate pairs.
The way matches are sorted in the output file can be changed with the -so option for the following formats: razers, fasta, sam, and afg. primary and secondary sort keys are:
0β 1. read number, 2. genome position1β 1. genome position, 2. read number
The coordinate space used for begin and end positions can be changed with the -pf option for the razer and fasta formats:
0β Gap space. Gaps between characters are counted from 0.1β Position space. Characters are counted from 1.
π₯ EXAMPLES π₯
okay these are the moments, bestie. copy them, run them, live them π
razers3 -i 96 -tc 12 -o mapped.razers hg18.fa reads.fq
Map single-end reads with 4% error rate using 12 threads. β¨
razers3 -i 95 -no-gaps -o mapped.razers hg18.fa reads.fq.gz
Map single-end gzipped reads with 5% error rate and no indels. π
razers3 -i 94 -rr 95 -tc 12 -ll 280 --le 80 -o mapped.razers hg18.fa
reads_1.fq reads_2.fq
Map paired-end reads with up to 6% errors, 95% sensitivity, 12 threads, and only output aligned pairs with an outer distance of 200-360bp. π
π«Ά reminder that this whole page is razers3 3.5.12 [tarball] β that's the version and where it came from, and it's dated to match the original page. go map something iconic, bestie. mwah π
β¨π
π¦ where this page comes from
- ubuntu stonking: seqan-apps 2.5.2-1 Β· BSD-3-Clause
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash on : a language model's rewrite of the original, under its terms