Patent ID: 11917028
Assignee: CHARLES SCHWAB & CO., INC.
Field: Digital communication (Electrical engineering)
Classification: CPC H  G | IPC G  H

Claim 8:
9. The method of claim 8 wherein the determining of the one or more most common n-step subsequences of asserted interactions comprises:
identifying, from among the LCP values stored in the LCP array, one or more consecutive runs of LCP values that are equal to or greater than n;
for each identified consecutive run of LCP values, determining a total number of LCP values in the identified consecutive run of LCP values;
determining, as one or more top consecutive runs of LCP values, one or more consecutive runs of LCP values, from among the identified consecutive runs of LCP values, having the highest total numbers of LCP values; and
identifying, as the one or more most common n-step subsequences, one or more n-step subsequences corresponding, respectively, to the one or more top consecutive runs of LCP values.