Determining enhanced longest common subsequences

A system for determining longest common subsequences in super-scale sequences using parallel processing, the system comprising:

• at least one computing device;
• and
• an enhanced longest common subsequence (ELCS) engine adapted to:
• receive a first sequence;
• receive a second sequence;
• receive user input;
• divide the first sequence into a first set of segments and the second sequence into a second set of segments according to the user input;
• for each pair of segments comprising a selected first segment from the first set of segments and a selected second segment from the second set of segments, process the pair of segments to generate segment data, wherein the segment data includes a length of a longest common subsequence of the pair of segments;
• merge the segment data from each of the pairs of segments;
• and
• determine a length of a longest common subsequence of the first sequence and the second sequence based on the merged subsequence data.

A method for determining longest common subsequences in super-scale sequences using parallel processing, the method comprising:

• receiving user input by a computing device;
• dividing a first sequence into a first set of segments and a second sequence into a second set of segments based on the user input by the computing device;
• for each pair of segments comprising a selected first segment from the first set of segments and a selected second segment from the second set of segments, processing the pair of segments to generate segment data, wherein the segment data includes a longest common subsequence of the pair of segments;
• merging the segment data from each of the pairs of segments by the computing device;
• determining a longest common subsequence of the first sequence and the second sequence based on the merged segment data by the computing device;
• and
• providing the longest common subsequence of the first sequence and the second sequence by the computing device.