Patent Document ID: 20140350917
Application ID: 13901736
Patent Status: 0

Claim One:
1. A method of identifying repeat subsequences of symbols in a sequence of symbols comprising: receiving a sequence of symbols drawn from an alphabet; defining values of x and y, where x corresponds to a threshold number of different left contexts for a given repeat subsequence in the sequence and y corresponds to a threshold number of different right contexts for a given repeat subsequence in the sequence to be identified as context diverse; generating a lexicographically sorted array of suffixes in the sequence; computing a longest common prefix array, each value in the longest common prefix array representing a length, in symbols, of a longest common prefix that occurs in an adjacent pair of suffixes in the lexicographically sorted array; sequentially comparing pairs of first and second sequential longest common prefix values and, based on the comparison, identifying at least one of: an occurrence of a same repeat subsequence, when the compared first and second longest common prefix values are the same; a new occurrence of a longer repeat subsequence when the second of the compared longest common prefix values is higher; and a last occurrence of a given repeat subsequence when the second of the compared longest common prefix values is lower; and based on the sequential comparisons, identifying context diverse repeat subsequences in the sequence, each of the identified context diverse repeat subsequences having at least the defined threshold number of different left and right contexts; and wherein at least one of the generating, computing, comparing, and identifying is performed by a computer processor.