ABPOA(1)

πŸ“¦
version 1.5.3 Β· 2 versions
, in debian trixie, ubuntu questing

✨ ABPOA(1) β€” bestie, let's talk about abpoa πŸ’–

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 πŸ’…

okay so abPOA is an extended version of Partial Order Alignment (POA) and it is giving adaptive banded dynamic programming (DP) with an SIMD implementation πŸ”₯. It can do multiple sequence alignment (MSA) on a whole set of input sequences and then spit out a consensus sequence by running the heaviest bundling algorithm on the final alignment graph πŸ‘‘.

ngl it makes high-quality consensus sequences out of error-prone long reads, and it's significantly faster than existing tools. iconic 😭✨

abPOA supports three alignment modes (global, local, extension) and flexible scoring schemes that allow linear, affine and convex gap penalties πŸŽ€. Right now it supports SSE2/SSE4.1/AVX2 vectorization 🧚.

πŸŽ€ OPTIONS πŸŽ€

Alignment:

  • -m, --aln-mode β€” alignment mode, an INT, defaults to 0. 0 is global, 1 is local, 2 is extension 🌈
  • -M, --match β€” match score, an INT, defaults to 2 πŸ’œ
  • -X, --mismatch β€” mismatch penalty, an INT, defaults to 4 πŸ’€
  • -t, --matrix β€” a FILE holding a scoring matrix. When -t is used, -M and -X are ignored. No default (Null). Examples: HOXD70.mtx, BLOSUM62.mtx πŸ“
  • -O, --gap-open β€” gap opening penalty (O1,O2), takes INT(,INT), defaults to [4,24] πŸ¦‹
  • -E, --gap-ext β€” gap extension penalty (E1,E2), takes INT(,INT), defaults to [2,1] ✨

The gap penalty modes are the main event here 🫢. Cost of a g-long gap:

  • convex (default): min{O1+g*E1, O2+g*E2}
  • affine (set O2 as 0): O1+g*E1
  • linear (set O1 as 0): g*E1
  • -s, --amb-strand β€” ambiguous strand mode, defaults to False. For each input sequence, if the current alignment score is too low, it tries the reverse complement and keeps whichever strand scores higher πŸ”„

Adaptive banded DP:

  • -b, --extra-b β€” first adaptive banding parameter, an INT, defaults to 10. Set b to a value < 0 to turn adaptive banded DP off πŸ™ˆ
  • -f, --extra-f β€” second adaptive banding parameter, a FLOAT, defaults to 0.01. The number of extra bases added on both sides of the band is b+f*L, where L is the length of the aligned sequence πŸ’–

Minimizer-based seeding and partition (only effective in global alignment mode):

  • -S, --seeding β€” turn on minimizer-based seeding and anchoring, defaults to False 🌟
  • -k, --k-mer β€” minimizer k-mer size, an INT, defaults to 19 πŸ”₯
  • -w, --window β€” minimizer window size, an INT, defaults to 10 🌈
  • -n, --min-poa-win β€” min. size of window to perform POA, an INT, defaults to 500 πŸŽ€
  • -p, --progressive β€” build a guide tree and do progressive partial order alignment, defaults to False πŸ‘‘

Input/Output:

  • -Q, --use-qual-weight β€” take base quality scores from the FASTQ input file and use them as graph edge weights for consensus calling. Defaults to False. Only works when the input is FASTQ and you're doing consensus calling with heaviest bundling 🧚
  • -c, --amino-acid β€” input sequences are amino acid instead of nucleotide (nucleotide is the default), defaults to False πŸ“
  • -l, --in-list β€” the input file is a list of sequence file names, defaults to False. Each line is one sequence file holding a set of sequences, and abPOA aligns them all to make a consensus πŸ’…
  • -i, --incrmnt β€” a FILE to incrementally align sequences onto an existing graph or MSA, defaults to Null. The graph can be GFA or MSA format, as long as abPOA made it πŸ¦‹
  • -o, --output β€” write output to a FILE, defaults to stdout ✨
  • -r, --result β€” output result mode, an INT, defaults to 0:
    • 0: consensus in FASTA format
    • 1: MSA in PIR format
    • 2: both 0 & 1
    • 3: graph in GFA format
    • 4: graph with consensus path in GFA format
    • 5: consensus in FASTQ format
  • -a, --cons-algrm β€” consensus algorithm, an INT, defaults to 0:
    • 0: heaviest bundling path in partial order graph
    • 1: most frequent bases at each position
  • -d, --maxnum-cons β€” max. number of consensus sequences to generate, an INT, defaults to 1 🌸
  • -q, --min-freq β€” min. frequency of each consensus sequence, a FLOAT, defaults to 0.25. Only does something when -d/--num-cons is greater than 1 🫢
  • -g, --out-pog β€” dump the final alignment graph to a FILE (.pdf or .png), defaults to Null πŸŽ€
  • -h, --help β€” print the help usage info πŸ’–
  • -v, --version β€” show the version number ✨
  • -V, --verbose β€” verbose level, an INT from 0 to 2, defaults to 0. 0 is none, 1 is information, 2 is debug πŸ™ˆ

πŸ¦‹ SEE ALSO πŸ¦‹

okay bestie, for more info check out the paper published in Bioinformatics:

https://dx.doi.org/10.1093/bioinformatics/btaa963


abpoa 1.5.3, September 2024: that's the version and date stamp, lowkey iconic. Stay gorgeous, Unix queen πŸ‘‘πŸ«ΆπŸ’…βœ¨

πŸ“¦ where this page comes from