KISSPLICE(1)

๐Ÿ“ฆ
version 2.6.7 ยท 3 versions
, in debian trixie, ubuntu resolute, ubuntu stonking

โœจ KISSPLICE(1) โœจ

okay bestie, sit down, hydrate, and let me tell you about kisSplice โ€” it's a User Commands situation and it's literally giving local assembly of SNPs, indels and AS events. ๐Ÿ’…


๐ŸŒธ NAME ๐ŸŒธ

kisSplice โ€” local assembly of SNPs, indels and AS events ๐Ÿงฌโœจ


๐ŸŽ€ SYNOPSIS ๐ŸŽ€

kissplice -h
kissplice [OPTION] [-r READFILES]

๐Ÿฆ‹ DESCRIPTION ๐Ÿฆ‹

So basically ๐Ÿ’– it detects alternative splicing events and other kinds of polymorphisms from READFILES (which can be in FASTA or FASTQ format, no cap).


๐Ÿ‘‘ OPTIONS ๐Ÿ‘‘

Every single flag, queen. Don't skip, iykyk. ๐ŸŒˆ

  • -h, --help โ€” shows this help message and dips out. ๐Ÿซถ
  • -r READFILES โ€” input fasta/q read files, or compressed (.gz) fasta/q files. You can stack them, multiple ones, like "-r file1 -r file2..." โœจ
  • -k KVAL โ€” k-mer size (default=41). ๐Ÿงต
  • -b BVAL โ€” maximum number of branching nodes (default: 5). ๐ŸŒฟ
  • -l LLMAX โ€” maximal length of the shorter path (default: 2k+1). ๐Ÿ“
  • -m LL_MIN โ€” minimum length of the shorter path (default 2k-8). ๐Ÿ“
  • -M UL_MAX โ€” maximum length of the longest path (default: 1000000). Skipped exons longer than UL_MAX are not reported, periodt. ๐Ÿšซ
  • -g GRAPH_PREFIX โ€” path and prefix to a pre-built de Bruijn graph (it's suffixed by .edges/.nodes). If you use it jointly with -r, the graph is used to find bubbles and the reads are used for quantification. ๐Ÿ•ธ๏ธ
  • -o OUT_DIR โ€” path to store the results (default = ./results). ๐Ÿ“
  • -d PATH_TO_TMP โ€” specific directory (absolute path, bestie, absolute) where temporary files get built (default is the temporary directory otherwise). ๐Ÿ—‚๏ธ
  • -t NBPROCS โ€” number of cores. It must be <= number of physical cores. No overcommitting, we're not messy. ๐Ÿ’ป
  • -s OUTPUT_SNPS โ€” 0, 1 or 2. Changes which types of SNPs will be output. If 0 (default), will not output SNPs. If 1, will output Type0a-SNPs. If 2, will output Type0a and Type0b SNPs.
โš ๏ธ warning: this option may increase a lot the running time. Like, a lot lot. ๐Ÿ˜ญ
  • -v โ€” verbose mode. Spill the tea, program. โ˜•
  • -u โ€” keep the nodes/edges file for unfinished bccs. ๐Ÿงบ
  • -c MIN_COV โ€” discard k-mers that are present strictly less than this number of times in the dataset (default 2). ๐Ÿงน
  • -C MIN_RELATIVE_COV โ€” discard edges with relative coverage below MIN_RELATIVE_COV, expressed as a percentage in [0,1) (default 0.05). ๐Ÿ“‰
  • -e MIN_EDIT_DIST โ€” classify as inexact repeats those bubbles whose paths' edit distance is smaller than MIN_EDIT_DIST (default 3). โœ๏ธ
  • -y MAX_CYCLES โ€” maximal number of bubble enumerations in each bcc. If exceeded, no bubble is output for the bcc (default: 100000000). ๐Ÿ”
  • --mismatches NB_MISMATCHES โ€” maximal number of substitutions authorized between a read and a fragment (for quantification only), default 2. If you increase the mismatch and use --counts, think of increasing min_overlap too, fr fr. ๐Ÿ”
  • --counts COUNTS_TYPE โ€” changes how the counts will be reported. If 0: total counts, if 1: counts on junctions, if 2 (default): all counts. ๐Ÿ”ข
  • --min_overlap MIN_OVERLAP โ€” sets how many nt must overlap a junction to be counted by the --counts option (default: 5). ๐Ÿ“Ž
  • --timeout TIMEOUT โ€” max amount of time (in seconds) spent enumerating bubbles in each bcc. If exceeded, no bubble is output for the bcc (default 100000). โฐ
  • --version โ€” display program's version number and exit. ๐Ÿท๏ธ
  • --output-context โ€” will output the maximum non-ambiguous context of a bubble. ๐Ÿ”ฎ
  • --output-path โ€” will output the id of the nodes composing the two paths of the bubbles. ๐Ÿ›ค๏ธ
  • --output-branch-count โ€” will output the number of branching nodes in each path. ๐ŸŒณ
  • --keep-bccs โ€” keep the node/edges files for all bccs. ๐Ÿ“ฆ
  • --not-experimental โ€” do not use a new experimental algorithm that searches for bubbles by listing all paths. ๐Ÿงช
  • --max-memory MAX_MEMORY โ€” if you use the experimental algorithm, you must provide the maximum size of the process's virtual memory (address space) in megabytes (default unlimited). ๐Ÿง 
  • --keep-counts โ€” keep the .counts file after the sequencing-errors-removal step. ๐Ÿงพ
  • --get-mapping-info โ€” creates a file with the KissReads mapping information of the reads on the bubbles. ๐Ÿ—บ๏ธ
  • --stranded โ€” execute kissreads in stranded mode. ๐Ÿงญ
  • --strandedAbsoluteThreshold โ€” sets the minimum number of reads mapping to a path of a bubble in a read set that is needed to call a strand. ๐ŸŽš๏ธ
  • --strandedRelativeThreshold โ€” if a strand is called for a path of a bubble in a read set, but the proportion of reads calling this strand is less than this threshold, then the strand of the path is set to '?' (any strand โ€” not enough evidence to call a strand). โ“
  • --keep-redundancy โ€” keep the Type_1 redundant cycles in the result file. โ™ป๏ธ
  • --keep-low-complexity โ€” keep the low-complexity Type_1 cycles in the result file. ๐Ÿซง
  • --lc-entropy-threshold โ€” cycles with a Shannon entropy value for their upper path below this value will be removed (use --keep-low-complexity to keep them). ๐ŸŒก๏ธ
  • --get-redundance-info โ€” creates files with informations on compressed redundant cycles. ๐Ÿ“„
  • --get-low-complexity-info โ€” creates a file with informations on removed low-complexity cycles. ๐Ÿ“ƒ
  • --type1-only โ€” only quantify Type 1 bubbles (alternative splicing events, MAJOR SPEED UP with -b > 10 BUT all other bubbles will not appear in the result file). ๐Ÿš€
โš ๏ธ bestie, read that BUT again. Speed comes at a price. ๐Ÿ’€

and that's the whole vibe, you're literally a kissSplice expert now ๐ŸŽ€โœจ

this page is from kissplice 2.6.7, dated 2025-04-30 โ€” mwah, kiss kiss, go assemble something iconic ๐Ÿ’–๐Ÿฆ‹๐ŸŒธ

๐Ÿ“ฆ where this page comes from