Author: Michael R. Crusoe <crusoe@ucdavis.edu>
Description: occurences -> occurrences
--- trinityrnaseq.orig/Inchworm/src/IRKE.cpp
+++ trinityrnaseq/Inchworm/src/IRKE.cpp
@@ -93,7 +93,7 @@
   	record_counter[i] = 0;
   }
 
-	cerr << "-reading Kmer occurences..." << endl;
+	cerr << "-reading Kmer occurrences..." << endl;
 	start = time(NULL);
 
 	Fasta_reader fasta_reader(fasta_filename);
--- trinityrnaseq.orig/Chrysalis/MakeDepend.cc
+++ trinityrnaseq/Chrysalis/MakeDepend.cc
@@ -420,7 +420,7 @@
 
   // The vector of pairs count_per_provider[] simply reverses the map
   // provider_counts[], copying each map element B->n to an ordered pair (n,B),
-  // so that the resulting vector can be sorted by number of occurences, rather
+  // so that the resulting vector can be sorted by number of occurrences, rather
   // than provider name.  (Why not build the mapping as a vector in the first
   // place?  Efficiency: keeping the vector sorted while building up the map
   // would require a lot of copying of data everytime a new provider name was
--- trinityrnaseq.orig/Inchworm/src/fastaToKmerCoverageStats.cpp
+++ trinityrnaseq/Inchworm/src/fastaToKmerCoverageStats.cpp
@@ -168,7 +168,7 @@
     for (int i = 0; i < omp_get_max_threads(); i++) {
         record_counter[i] = 0;
     }
-    cerr << "-reading Kmer occurences..." << endl;
+    cerr << "-reading Kmer occurrences..." << endl;
     start = time(NULL);
     Fasta_reader fasta_reader(kmers_fasta_file);
     #pragma omp parallel private (myTid)
