title: partial matching of strings/sequences
body: <p>Looking for the string sequences <code>AATGGGTTCCA</code>  in multiple sequences. But want to allow for N edit distances (replacements or insertions into the string)</p>
  
  <p>so in a long string it might match AATG*<em>C</em>*GTTCCA (replacement) or AATGGTTCCA (deletion) or AATGGG*<em>T</em>*TTCCA (insertion) </p>
  
  <p>What is the fastest algorithm when dealing with many sequences.</p>
  
  <p>EDIT: because you can match infinite strings.. lets assume 1 nucleotide insertion, deletion or replacement for a maximum of 5 locations
  BLAST would also be an option</p>