3db237ff65edd8bfc52f4b22088feb2acbc78bd0 mspeir Tue Nov 24 11:32:18 2015 -0800 Correcting spelling mistakes in usage and error messages, refs #14062 diff --git src/hg/patCount/patCount.c src/hg/patCount/patCount.c index d578418..9bf843b 100644 --- src/hg/patCount/patCount.c +++ src/hg/patCount/patCount.c @@ -1,31 +1,31 @@ /* PatCount - Counts up the number of occurences of each * oligo of a fixed size (up to 13) in input sequence. * Writes all patterns that are overrepresented according * to a threshold to output. */ /* Copyright (C) 2011 The Regents of the University of California * See README in this or parent directory for licensing information. */ #include "common.h" #include "dnaseq.h" #include "fa.h" #include "sig.h" void usage() { -errAbort("patCount - counts up the number of occurences of each\n" +errAbort("patCount - counts up the number of occurrences of each\n" "oligo of a fixed size (up to 13) in input. Writes out\n" "all patterns that are overrepresented by at least factor\n" "to output, which is a binary .ooc file used by patSpace\n" "nucleotide homology algorithms.\n" "usage:\n" " patCount out.ooc oligoSize overFactor faFiles(s)\n" "example:\n" " patCount hgt.ooc 13 6 hgt1.fa hgt2.fa hgt3.fa"); } unsigned long powerOfFour(int oligoSize) /* Return integer power of four. */ { unsigned long p = 1; int i; @@ -227,22 +227,22 @@ maxCount = count; if (count >= thresh) { ++overCount; writeOne(out, patIx); } } } fclose(out); } /* Write statistics to console. */ printf("Statistic for oligos of size %d (patSpaceSize %zu)\n", oligoSize, patSpaceSize); printf("Total oligos %d\n", totalCount); printf("Distinct oligos %d\n", distinctCount); -printf("Maximum occurences of single oligo %d\n", maxCount); +printf("Maximum occurrences of single oligo %d\n", maxCount); printf("OverFactor %4.2f yeilds threshold %d\n", overFactor, thresh); printf("Oligos filtered out as too common %d (%2.1f%%)\n", overCount, 100.0*overCount/distinctCount); return 0; }