From: Michael R. Crusoe <crusoe@debian.org>
Subject: spelling fixes
Forwarded: https://github.com/chanzuckerberg/shasta/pull/225
--- shasta.orig/src/AssemblerOptions.cpp
+++ shasta/src/AssemblerOptions.cpp
@@ -325,12 +325,12 @@
         ("MinHash.minBucketSize",
         value<int>(&minHashOptions.minBucketSize)->
         default_value(0),
-        "The minimum bucket size to be used by the LowHash algoritm.")
+        "The minimum bucket size to be used by the LowHash algorithm.")
 
         ("MinHash.maxBucketSize",
         value<int>(&minHashOptions.maxBucketSize)->
         default_value(10),
-        "The maximum bucket size to be used by the LowHash algoritm.")
+        "The maximum bucket size to be used by the LowHash algorithm.")
 
         ("MinHash.minFrequency",
         value<int>(&minHashOptions.minFrequency)->
--- shasta.orig/src/approximateColoring.hpp
+++ shasta/src/approximateColoring.hpp
@@ -40,7 +40,7 @@
   subgraph - that is, the vertex with the greatest number of uncolored
   adjacent vertices.
 
-The DSatur algoritm is an approximate coloring algorithm, but it
+The DSatur algorithm is an approximate coloring algorithm, but it
 is exact for 2-colorable graphs.
 
 This function applies the above algorithm to a Boost undirected graph.
