X-Git-Url: http://source.jalview.org/gitweb/?a=blobdiff_plain;ds=sidebyside;f=src%2Fcom%2Fstevesoft%2Fpat%2FSkipBMH.java;h=82575486fc4f298a9a85a517a60449b573124f7f;hb=c9912c36174ed61461c0f9eea0211295759fc4cb;hp=1397b9006099803b404f6d63d76116b9c4992515;hpb=506d60f0e188723ddc91c26824b41ac7034df3fe;p=jalview.git
diff --git a/src/com/stevesoft/pat/SkipBMH.java b/src/com/stevesoft/pat/SkipBMH.java
index 1397b90..8257548 100755
--- a/src/com/stevesoft/pat/SkipBMH.java
+++ b/src/com/stevesoft/pat/SkipBMH.java
@@ -7,15 +7,15 @@
//
package com.stevesoft.pat;
-import com.stevesoft.pat.wrap.*;
+import com.stevesoft.pat.wrap.StringWrap;
/**
* Like Skip, but implements a
- * Boyer-Moore-Horspool type search method that has been modified to be
- * more like a "T-search" (see the Michael Tamm''s article in C'T, magazin
- * fuer computer und technic, August 97 p 292). Yet another important
- * source of information for me was the type search method that has been modified to be more
+ * like a "T-search" (see the Michael Tamm''s article in C'T, magazin fuer
+ * computer und technic, August 97 p 292). Yet another important source of
+ * information for me was the Deep Magic
* article on string searching. As of this writing, I can beat String's indexOf
* method in many cases.