KTCLASSIFYBLAST(1)
π ktClassifyBLAST β from the ktClassifyBLAST(1) manual, bestie edition π§
okay so. sit down, grab a strawberry, because we're about to talk about ktClassifyBLAST and it is genuinely giving main character energy. this is a User Commands page, and the version we're vibing with is ktClassifyBLAST 2.8 from June 2021. more on that at the very end, stay with me π
β¨ NAME β¨
ktClassifyBLAST β explore hierarchical metagenomic data with zoomable pie charts π
yes, the NAME section really does say "zoomable pie charts" and honestly? iconic. we keep it.
π¦ DESCRIPTION π¦
so here's the tea: ktClassifyBLAST assigns each query in tabular BLAST results to an NCBI taxonomy ID. that's the whole job. that's the mission.
and listen β if the results contain comment lines, then queries with no hits will still be included in the output, with taxonomy IDs of -1. that's for consistency with MEGAN, periodt. not me being nice about it, that's just literally how it works π
here's how you call it:
ktClassifyBLAST \
[options] \
blast_output_1 \
[blast_output_2] \
...
πΈ the arguments πΈ
blast_outputβ the file (or files) containing BLAST results in tabular format. when you're downloading from NCBI, this is the one labelled"Hit table (text)". and if you're running BLAST locally, heads up bestie: the subject IDs in your local database must contain accession numbers, either bare or in the fourth field of the pipe-separated format, like"gi|12345|xx|ABC123.1|". no accession numbers, no classification, iykyk.
π OPTIONS π
one bullet per flag, no skips, no cuts, we are thorough in this house π
-o <string>β output file name. [Default:'blast.taxonomy.tab']-t <number>β the threshold for bit score differences when figuring out which hits count as "best". any hit whose score is within this distance of the highest score gets included when computing the lowest common ancestor (or picked randomly, if you passed-r). [Default:'3']-fβ if any of the best hits have unknown accessions, this forces classification to the root instead of just ignoring them. no silent ghosting here π-rβ pick randomly from the best hits instead of finding the lowest common ancestor. chaos mode, but make it science π₯-pβ use percent identity for the average scores instead of log[10] e-value.-bβ use bit score for the average scores instead of log[10] e-value.-sβ summarize counts and average scores by taxonomy ID.-e <number>β the E-value factor for determining "best" hits. real talk though: a bit score difference threshold (-t) is recommended instead, because it saves you from comparing e-values that BLAST reports as0thanks to floating point underflow. π however β and this is the plot twist β an e-value factor should be used if your input is a concatination of BLASTs against different databases. different databases, different rules, bestie.
β οΈ note that the manpage spells it "concatination" and we are respecting the original spelling, no cap.
π OUTPUT FORMATS π
default vibes:
<queryID> <taxID> <score>
summarized (-s) vibes:
<count> <taxID> <score>
π«Ά what those fields even mean π«Ά
queryIDβ the query ID exactly as it appears in the BLAST results. exactly. character for character. don't @ me.taxIDβ the NCBI taxonomy ID the query got assigned to (or-1if it has no hits at all π₯Ί).scoreβ the score of the assignment(s). by default that's the average E-value of the "best" hits (see-pand-bif you wanna change that up).countβ the number of assignments.
β a lil sign-off β
that's the whole page, babe. this was ktClassifyBLAST 2.8, dated June 2021, living under the User Commands section of the manual β and now you know her. go classify something. slay ππ
β¨
π¦ where this page comes from
- debian bookworm: radiant 2.8.1+dfsg-2 Β· BSD-3-Clause
- debian trixie: radiant 2.8.1+dfsg-2 Β· BSD-3-Clause
- ubuntu jammy: radiant 2.8.1+dfsg-1 Β· BSD-3-Clause
- ubuntu noble: radiant 2.8.1+dfsg-2 Β· BSD-3-Clause
- ubuntu questing: radiant 2.8.1+dfsg-2
- ubuntu resolute: radiant 2.8.1+dfsg-2build1 Β· BSD-3-Clause
- ubuntu stonking: radiant 2.8.1+dfsg-3 Β· BSD-3-Clause
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash on : a language model's rewrite of the original, under its terms