12. A cyclic computer implemented method for providing K character pattern match indication between substrings of a first character string stored in a sliding window history buffer and substrings of a second character string stored in a lookahead buffer, comprising during each cycle the steps of: (a) parsing one or more maximal length substrings including any substring prefix extending from the first to the second character string by executing a recursive exhaustive greedy comparison match over and between the first and second strings in the buffers consistently in a selected one of either a forward or backward direction across an ordered set of nested recursion intervals, step (a) further including the substeps of: (1) updating a prefix register with a K+1 character prefix extension if a backward or forward greedy comparison match results in a match length L=K+1, (2) updating the prefix register with the longest match found, assigning a tracking variable J=(K-L) if the match length L&lt;K+1 and if the longest match L=1, (3) if J&gt;0 for a backward recursive comparison match or if J&lt;K for a forward comparison match, identifying the longest pattern matching length L' between the first and second strings by re-executing a recursive exhaustive greedy comparison match over and between the first and second strings in the buffers in the same direction as originally executed until either L'=J+1, terminating the pattern matching, or, recurring the pattern match on this substep; (b) denoting the locations of any ascertained maximal substring pattern matches in the look-ahead and history buffers, transferring the characters terminating a prefix extension during the cycle from the lookahead buffer to the history buffer, and rendering the prefix register contents available for processing external to the method; and (c) repeating steps (a) and (b) until the second character string becomes exhausted.
12. A cyclic computer implemented method for providing K character pattern match indication between substrings of a first character string stored in a sliding window history buffer and substrings of a second character string stored in a lookahead buffer, comprising during each cycle the steps of: (a) parsing one or more maximal length substrings including any substring prefix extending from the first to the second character string by executing a recursive exhaustive greedy comparison match over and between the first and second strings in the buffers consistently in a selected one of either a forward or backward direction across an ordered set of nested recursion intervals, step (a) further including the substeps of: (1) updating a prefix register with a K+1 character prefix extension if a backward or forward greedy comparison match results in a match length L=K+1, (2) updating the prefix register with the longest match found, assigning a tracking variable J=(K-L) if the match length L&lt;K+1 and if the longest match L=1, (3) if J&gt;0 for a backward recursive comparison match or if J&lt;K for a forward comparison match, identifying the longest pattern matching length L' between the first and second strings by re-executing a recursive exhaustive greedy comparison match over and between the first and second strings in the buffers in the same direction as originally executed until either L'=J+1, terminating the pattern matching, or, recurring the pattern match on this substep; (b) denoting the locations of any ascertained maximal substring pattern matches in the look-ahead and history buffers, transferring the characters terminating a prefix extension during the cycle from the lookahead buffer to the history buffer, and rendering the prefix register contents available for processing external to the method; and (c) repeating steps (a) and (b) until the second character string becomes exhausted. 13. The method according to claim 12, wherein the K constitutes any positive integer number of characters less than the second character string length.