1. A computer-implemented method of determining matching subsequences between a first sequence of values and a second sequence of values, said method comprising: inputting said first and second sequences of values into an alignment algorithm, said alignment algorithm defining a plane of points corresponding to said sequences of values, said alignment algorithm identifying similar points on said plane according to a predefined similarity metric, and said alignment algorithm grouping a plurality of said similar points between said two sequence values so as to define a path according to said alignment algorithm, and outputting a series of optimized matching subsequences according to predetermined path characteristic metrics, wherein said alignment algorithm uses a one-dimensional vector structure of paths, and said paths have a non-linear alignment between said matching subsequences.