A method and means for ascertaining maximal length pattern matches of K characters per cycle between character strings in a reduced amount of time using a pipeline like concurrent dataflow model in which a recursive exhaustive greedy comparison matching between the strings in consistent direction yields...http://www.google.de/patents/US5525982?utm_source=gb-gplus-sharePatent US5525982 - Method and means for character string pattern matching for compression and the like using minimal cycles per character
