The Optimization of Methods of Finding the Longest Common Subsequence and the Development of Algorithms of Their Implementation in a Graphical Processor

In the era of growing informatization of society more people deal with and more computing power is consumed by producing, storing and processing of information. One of the classic tasks of informatics is searching for the longest common sub-sequence of two and more sequences. The task of finding the longest common sub-sequence is the task of searching for a sequence which is a sub-sequence of several sequences. A sub-sequence can be acquired from a certain finite sequence if a certain set of its elements (possibly, an empty set) is taken out of it. The array of tasks requiring finding the longest common sub-sequence is fairly large: finding the difference between files (diff) for a version control system (CVS), DNA sequencing, the task of finding plagiarism, solving multi-criteria problems with the help of genetic algorithm