SURANKCO-FEATURE(1)
π SURANKCO-FEATURE π
okay bestie, gather round, because this is the manual page for surankco-feature, and it lives in the User Commands section of the manual. yes, THE User Commands section. iconic behavior only.
β¨ NAME β¨
surankco-feature β feature generation from contigs and corresponding reads π§¬πΈ
π¦ SYNOPSIS π¦
surankco-feature [options]
that's it. that's the whole vibe. just options, no positional drama. we love a low-maintenance queen. π
πΈ DESCRIPTION πΈ
So like, what does this do? Feature generation, obviously. From contigs β which need to be in ACE format β and the corresponding reads, which you're gonna bring in QUAL or FASTQ format. that's the whole assignment. contigs plus reads, features come out. periodt. β¨
π OPTIONS π
okay this is the part where you actually pay attention, bestie, because every single flag matters and I'm not about to let you skim. π
-aASSEMBLIES,--assemblies=ASSEMBLIES β hand over a list of assembly files, comma separated, and the suffixes HAVE to be correct, no cap. like".ace"β mandatory, fr fr. π-dDIRECTORY,--directory=DIRECTORY β point at a directory that's holding assembly files in the format you declared (default is ace, go peek at-fif you forgot).-fASSEMBLY.FORMAT,--assembly.format=ASSEMBLY.FORMAT β tell it the assembly/contig format, aka the suffix. your choices are"ace"(the default, she's the main character) or"contigs.fasta".-rREAD.QUALITY.FORMAT,--read.quality.format=READ.QUALITY.FORMAT β declare the read quality format:qual,quaorfastqfor ACE (default is"qual"), and resp.samorbamfor contigs.fasta (default is"sam"). pick your fighter. π₯-qFASTQ.VERSION,--fastq.version=FASTQ.VERSION β set the fastq version:auto,sanger,solexa,illumina13,illumina15,illumina18(that last one is the default, she's the chosen one). only needed for ACE assemblies, so if you're not in ACE land you can skip. π«Ά-sSPLIT.REGEX,--split.regex=SPLIT.REGEX β drop a regular expression to cutoff read names, which you'd need if the assembler went and modified them. only needed for ACE assemblies. β οΈ and listen closely: if you need a backslash"\", you have to write"\\\\"! yes really. the escaping is giving chaos but that's the rule. π-tTHREADS,--threads=THREADS β how many cores or threads you wanna throw at it. might speed up some parallelized operations (default:1). go on, give her more, she can handle it.-mMEMORY,--memory=MEMORY β the maximum memory usage, in Gb, for Java's virtual machine (default:32). if you're working with big data sets and it starts reporting heap space problems, try bumping this up. π₯-k,--kmer.featuresβ decides whether k-mer features get computed or not. heads up: this is experimental and has a very long runtime. the default is not to do it, and honestly? respect the default. π-gEXPECTED.GENOME.SIZE,--expected.genome.size=EXPECTED.GENOME.SIZE β give a list of expected genome sizes (comma separated) or just one value that applies to all assemblies. default is0, which makes it estimate the genome sizes as the sum of contig lengths. she'll figure it out herself, queen. π-cCONTIG.SIZE.FILTER,--contig.size.filter=CONTIG.SIZE.FILTER β set a minimum contig size. default:0.-h,--helpβ show this help message and exit. the classic. the icon. π
π AUTHOR π
This manpage was written by Andreas Tille for the Debian distribution, and it can be used for any other usage of the program. shoutout to Andreas for real, that's generous energy and we love to see it. π«Ά
and that's the whole page, bestie! π this was surankco-feature version 0.0.r5, dated March 2016 β old enough to have a driver's license but still serving. mwah. πβ¨π¦
π¦ where this page comes from
- debian bookworm: surankco 0.0.r5+dfsg-3 Β· BSD-3-Clause
- debian trixie: surankco 0.0.r5+dfsg-4 Β· BSD-3-Clause
- ubuntu jammy: surankco 0.0.r5+dfsg-3 Β· BSD-3-Clause
- ubuntu noble: surankco 0.0.r5+dfsg-4 Β· BSD-3-Clause
- ubuntu questing: surankco 0.0.r5+dfsg-4
- ubuntu resolute: surankco 0.0.r5+dfsg-5 Β· BSD-3-Clause
- ubuntu stonking: surankco 0.0.r5+dfsg-5 Β· BSD-3-Clause
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash on : a language model's rewrite of the original, under its terms