×

Algorithms for selecting subsequences

  • US 8,131,751 B1
  • Filed: 12/03/2008
  • Issued: 03/06/2012
  • Est. Priority Date: 01/18/2008
  • Status: Expired due to Fees
First Claim
Patent Images

1. A computer-implemented method for selecting shingles, the method comprising:

  • parsing, by one or more processors, a first sequence of n tokens into shingles of k tokens, where k and n are numerical values and k<

    =n, and where each of the n tokens has a numerical value;

    selecting a first set of shingles of k tokens from the shingles of k tokens parsed from the first sequence of n tokens, where each shingle in the first set includes one of (i) a token in a first position in the shingle having a largest numerical value of all tokens in the shingle or (ii) a token in a last position in the shingle having the largest numerical value of all tokens in the shingle;

    parsing a second sequence of x tokens into shingles of k tokens, where x is a numerical value and k<

    =x, and where each of the x tokens has a numerical value;

    selecting a second set of shingles of k tokens from the shingles of k tokens parsed from the second sequence of x tokens, where each shingle in the second set includes one of (i) a token in a first position in the shingle having a largest numerical value of all tokens in the shingle or (ii) a token in a last position in the shingle having the largest numerical value of all tokens in the shingle; and

    comparing at least a portion of the first set of shingles of k tokens with at least a portion of the second set of shingles of k tokens.

View all claims
  • 2 Assignments
Timeline View
Assignment View
    ×
    ×