Showing
1 changed file
with
16 additions
and
16 deletions
... | @@ -250,21 +250,21 @@ void outputCliques ( | ... | @@ -250,21 +250,21 @@ void outputCliques ( |
250 | void usage() | 250 | void usage() |
251 | { | 251 | { |
252 | std::cout << "C-RCPred (Constrained RNA Complex Prediction)" << std::endl | 252 | std::cout << "C-RCPred (Constrained RNA Complex Prediction)" << std::endl |
253 | - << " -f: Input fasta file" << std::endl | 253 | + << " -f Input fasta file" << std::endl |
254 | - << " -s: Input secondary structure files," << std::endl | 254 | + << " -s Input secondary structure files," << std::endl |
255 | - << " -i: Input interaction secondary structure files," << std::endl | 255 | + << " -i Input interaction secondary structure files," << std::endl |
256 | - << " -c: Constraint files where constraints are in the same order than the secondary structure and interaction files" << std::endl | 256 | + << " -c Constraint files where constraints are in the same order than the secondary structure and interaction files" << std::endl |
257 | - << " -p: Probing data file for each RNA, in the same order than the fasta files (if no data for an RNA, an empty file is needed)" << std::endl | 257 | + << " -p Probing data file for each RNA, in the same order than the fasta files (if no data for an RNA, an empty file is needed)" << std::endl |
258 | - << " -o: Format of output \"d\" (dot-parenthesis, default), \"j\" (JSON) or \"b\" (base pair list format)" << std::endl | 258 | + << " -o Format of output \"d\" (dot-parenthesis, default), \"j\" (JSON) or \"b\" (base pair list format)" << std::endl |
259 | - << " -e: Energy model (0: No energy model; use energies computed by upstream tools, 1: ViennaRNA package model; default, 2: NUPACK model)" << std::endl | 259 | + << " -e Energy model (0: No energy model; use energies computed by upstream tools, 1: ViennaRNA package model; default, 2: NUPACK model)" << std::endl |
260 | - << " -t: Threshold for compatibility RNA (0->100, default 100)" << std::endl | 260 | + << " -t Threshold for compatibility RNA (0->100, default 100)" << std::endl |
261 | - << " -l: Lower probing threshold (0->100, if not specified, probing values between 0% and the upper threshold once normalized will not be taken into account)" << std::endl | 261 | + << " -l Lower probing threshold (0->100, if not specified, probing values between 0% and the upper threshold once normalized will not be taken into account)" << std::endl |
262 | - << " -u: Upper probing threshold (0->100, if not specified, probing values between the lower threshold and 100% once normalized will not be taken into account)" << std::endl | 262 | + << " -u Upper probing threshold (0->100, if not specified, probing values between the lower threshold and 100% once normalized will not be taken into account)" << std::endl |
263 | - << " -g: Output graph file" << std::endl | 263 | + << " -g Output graph file" << std::endl |
264 | - << " -k: Output cliques predicted" << std::endl | 264 | + << " -k Output cliques predicted" << std::endl |
265 | - << " -q: Output cliques predicted without duplicates" << std::endl | 265 | + << " -q Output cliques predicted without duplicates" << std::endl |
266 | - << " -m: Maximum number of structures to output" << std::endl | 266 | + << " -m Maximum number of structures to output" << std::endl |
267 | - << " -h: Shows this message" << std::endl; | 267 | + << " -h Shows this message" << std::endl; |
268 | } | 268 | } |
269 | 269 | ||
270 | // Main | 270 | // Main |
... | @@ -279,7 +279,7 @@ int main(int argc, char *argv[]) { | ... | @@ -279,7 +279,7 @@ int main(int argc, char *argv[]) { |
279 | if(argc > 1) { | 279 | if(argc > 1) { |
280 | // Parse options | 280 | // Parse options |
281 | char ch; | 281 | char ch; |
282 | - while ((ch=char(getopt(argc, argv, "f:s:i:c:o:t:e:p:l:u:g:k:q:m:h:?")))!=-1) { | 282 | + while ((ch=char(getopt(argc, argv, "hf:s:i:c:o:t:e:p:l:u:g:k:q:m:?")))!=-1) { |
283 | switch (ch) { | 283 | switch (ch) { |
284 | case 'f': | 284 | case 'f': |
285 | SEQfile = optarg; | 285 | SEQfile = optarg; | ... | ... |
-
Please register or login to post a comment