X-Git-Url: https://git.donarmstrong.com/?p=mothur.git;a=blobdiff_plain;f=suffixdb.hpp;h=15114cf9a103707b67486864fd0d8b40f96e95c7;hp=3d0b01d187fe938451056e0ff10621c5a4c941b4;hb=74c78f9abd9e733f0c2f812efec97a76632fcbf8;hpb=544469443afe44920bdf279aefd26d29534cabaf

diff --git a/suffixdb.hpp b/suffixdb.hpp
index 3d0b01d..15114cf 100644
--- a/suffixdb.hpp
+++ b/suffixdb.hpp
@@ -9,7 +9,7 @@
  *  Copyright 2008 Patrick D. Schloss. All rights reserved.
  *
  *	This is a child class of the Database abstract datatype.  The class is basically a database of suffix trees and an
- *	encapsulation of the method for finding the most similar tree to an inputted sequence.  the suffixForest objecct
+ *	encapsulation of the method for finding the most similar tree to an inputted sequence.  the suffixForest object
  *	is a vector of SuffixTrees, with each template sequence being represented by a different SuffixTree.  The class also
  *	provides a method to take an unaligned sequence and find the closest sequence in the suffixForest.  The search
  *	method is inspired by the article and Perl source code provided at http://www.ddj.com/web-development/184416093.  I