anchor.diff:  <br>
   Boyer Moore
   ===========
  -
  +<a id="Author" href="https://github.com/WieczorekE">&#128366;view author of this tutorial</a>
   
   Usage
   -----
  
positive.code: <br>
  Knuth Morris Pratt
  ==================
  the KMP algorithm makes use of previous match information to determine an amount of skips that can be made until the next position in the source gets examined as a possible match.
  To achieve that, a prefix table (or failure function) of the pattern needs to be computed, which determines the amount of skippable elements depending on the previous (partial) match.
  
  
  
negative.code: 
  String matching algorithms
  ==========================
  <a id="SourceCode" href="https://github.com/CSBiology/BioFSharp/blob/master/src/BioFSharp/Algorithm/PatternQuery.fs">&lt;/&gt;view source code</a> <a id="Author" href="https://github.com/kMutagene">&#128366;view author of this tutorial</a><br><br>
  
  String matching algorithms are concerned with finding a single or multiple matches of a query pattern within a source. The sub-modules of the `BioFSharp.Algorithm.StringMatching` module are organized as following:
  
  