ABPOA(1)
β¨ ABPOA(1) β User Commands β¨
Okay bestie, let's talk about abPOA π (the manual name is abpoa, and it also shows up as abpoa.avx2, abpoa.avx, abpoa.sse4.1, abpoa.ssse3, abpoa.sse3, and abpoa.generic π¦).
πΈ NAME
abpoa, abpoa.avx2, abpoa.avx, abpoa.sse4.1, abpoa.ssse3, abpoa.sse3, abpoa.generic β adaptive banded Partial Order Alignment β¨
π SYNOPSIS
abpoa [options] <in.fa/fq> > cons.fa/msa.fa/abpoa.gfa
π DESCRIPTION
So abPOA is an extended version of Partial Order Alignment (POA) that does adaptive banded dynamic programming (DP) with an SIMD implementation π₯. It can run multiple sequence alignment (MSA) on a set of input sequences, then make a consensus sequence by applying the heaviest bundling algorithm to the final alignment graph π.
Lowkey iconic: it can make high-quality consensus sequences from error-prone long reads and is way faster than existing tools ππ.
It supports three alignment modes (global, local, extension) and flexible scoring schemes that allow linear, affine and convex gap penalties π§. It currently supports SSE2/SSE4.1/AVX2 vectorization π.
π¦ OPTIONS
β¨ Alignment β¨
-m,--aln-modeβ alignment mode, anINT, default0π.0is global,1is local,2is extension.-M,--matchβ match score, anINT, default2π.-X,--mismatchβ mismatch penalty, anINT, default4π.-t,--matrixβ scoring matrix file, aFILE, defaultNullπ.-Mand-Xare not used when-tis used. Examples:HOXD70.mtx, BLOSUM62.mtx.-O,--gap-openβ gap opening penalty(O1,O2), anINT(,INT), default4,24π₯.-E,--gap-extβ gap extension penalty(E1,E2), anINT(,INT), default2,1π . abPOA has three gap penalty modes, where the cost of a g-long gap is:- convex (default):
min{O1+g*E1, O2+g*E2} - affine (set
O2as0):O1+g*E1 - linear (set
O1as0):g*E1
- convex (default):
-s,--amb-strandβ ambiguous strand mode, defaultFalseπ§. For each input sequence, it tries the reverse complement if the current alignment score is too low, then picks whichever strand has the higher score π¦.
β¨ Adaptive banded DP β¨
-b,--extra-bβ first adaptive banding parameter, anINT, default10πΈ. Setbto a value< 0to disable adaptive banded DP π ββοΈ.-f,--extra-fβ second adaptive banding parameter, aFLOAT, default0.01π«Ά. The number of extra bases added on both sides of the band isb+f*L, whereLis the length of the aligned sequence.
β¨ Heuristics for graph alignment (under development) β¨
-G,--int-path-scoreβ include log-scaled path score for graph alignment, defaultFalseπ.-L,--sort-by-lenβ sort input sequences by length in descending order, defaultFalseπ.-R,--gap-on-rightβ put indels on the right-most side of the alignment (the default is left), defaultFalseπ¦.-J,--gap-at-endβ always put indels at the end of the alignment if possible, defaultFalseβ¨.
β¨ Minimizer-based seeding and partition (only effective in global alignment mode) β¨
-S,--seedingβ enable minimizer-based seeding and anchoring, defaultFalseπ.-k,--k-merβ minimizer k-mer size, anINT, default19π§.-w,--windowβ minimizer window size, anINT, default10πΈ.-n,--min-poa-winβ min. size of window to perform POA, anINT, default500π.-p,--progressiveβ build a guide tree and perform progressive partial order alignment, defaultFalseπ.
β¨ Input/Output β¨
-Q,--use-qual-weightβ take the base quality score from a FASTQ input file as the graph edge weight for consensus calling, defaultFalseπ₯. This is only effective when input sequences are in FASTQ format and consensus calling uses heaviest bundling.-c,--amino-acidβ input sequences are amino acid (the default is nucleotide), defaultFalseπ§¬.-l,--in-listβ input file is a list of sequence file names, defaultFalseπ. Each line is one sequence file containing a set of sequences, which abPOA will align to generate a consensus sequence π«Ά.-i,--incrmntβ incrementally align sequences to an existing graph or MSA, aFILE, defaultNullπ¦. The graph can be in GFA or MSA format generated by abPOA.-o,--outputβ output toFILE, defaultstdoutπ.-r,--resultβ output result mode, anINT, default0π. The modes are:0: consensus in FASTA format1: MSA in PIR format2: both0&13: graph in GFA format4: graph with consensus path in GFA format5: consensus in FASTQ format
-a,--cons-algrmβ consensus algorithm, anINT, default0π . The options are:0: heaviest bundling path in partial order graph1: most frequent bases at each position
-d,--maxnum-consβ max. number of consensus sequences to generate, anINT, default1π―ββοΈ.-q,--min-freqβ min. frequency of each consensus sequence (only effective when-d/--num-cons>1), aFLOAT, default0.25π·.-g,--out-pogβ dump final alignment graph toFILE(.pdf/.png), defaultNullπΈ.-h,--helpβ print this help usage information π.-v,--versionβ show version number π’.-V,--verboseβ verbose level, anINT, default0π£οΈ.0is none,1is information,2is debug.
π SEE ALSO
For more information, please refer to the paper published in Bioinformatics π:
https://dx.doi.org/10.1093/bioinformatics/btaa963
Bye bestie, that's the whole tea βπ β abpoa 1.5.5, November 2025, ABPOA(1) π«Άβ¨
π¦ where this page comes from
- ubuntu resolute: abpoa 1.5.5-1ubuntu1 Β· MIT
- ubuntu stonking: abpoa 1.5.5-1ubuntu1 Β· MIT
- π girlified by claude-haiku-5-5 on : a language model's rewrite of the original, under its terms