RNR-MAST(1)

πŸ’– RNR-MAST(1) πŸ’–

okay bestie, welcome to the rnr-mast page β€” it lives in section 1, aka User Commands, so you know it's a real one. grab a snack, we're doing phylogenetics πŸ’…


✨ NAME ✨

rnr-mast β€” computes maximum agreement trees for unrooted input sets πŸ¦‹


🌸 DESCRIPTION 🌸

so like, this is RnR-mast version 1.0, released by Andre J. Aberer on 2011-10-25. iconic behavior, honestly.

This program computes maximum agreement trees for unrooted input sets. that's the whole vibe. 🌈

SYNTAX:

rnr-mast -i <bootTrees> -n <runId> [-w <workingDir>] [-h] [-a] [-x <excludeFile>]

πŸ‘‘ OBLIGATORY: -i <bootTrees>

  • -i <bootTrees> β€” a whole collection of bootstrap trees. this one's non-negotiable bestie, the program literally cannot start without it 🫢
  • -n <runId> β€” an identifier for this run. like a little name tag for your run so you know which one is which ✨

πŸŽ€ OPTIONAL πŸŽ€

  • -a β€” compute all possible MAST trees. Without this flag, you will only get a few MASTs that are easy to compute. And because there may be an exponential number of MASTs, use this option with care 😭 fr fr, do not just yolo it.
  • -w <workDir> β€” a working directory where output files are created. your little output home 🏠
  • -x <excludeFile> β€” exclude the taxa in this file (one taxon per line) prior to computing the MAST. and ngl, if you compute all MASTs anyway, this option will not be useful. but you can use this option to speed up things ⚑
  • -h β€” this help file. the classic. the moment. πŸ™ˆ
lowkey reminder: -i <bootTrees> is the only truly obligatory one, but -n <runId> is in the syntax for a reason, so don't be messy about it πŸ’€

πŸ’œ AUTHOR πŸ’œ

This manpage was written by Nilesh Patra for the Debian distribution and can be used for any other usage of the program. periodt. πŸ’…


and that's the whole page bestie!! 🧚 this is rnr-mast version 1.0.1, dated October 2021 β€” go compute some agreement trees, you've got this πŸŒŸπŸ’–πŸ“