Accepted_test

Among the problems of fundamental bioinformatics, one can highlight the task of aligning nucleotide sequences. The solution to this problem is required in phylogenetic analysis, finding evolutionarily conserved DNA regions, but it is extremely complex and belongs to the class of NP-difficult.
The use of supercomputers is a rather expensive solution, so the authors proposed the idea of using a decentralized solution based on the approach of projects such as MilkyWay@Home, Einstein@Home, SETI@home, etc. This approach is called voluntary computing - distributed computing using voluntarily provided computing resources. The general scheme of participation in such a distributed computing project is that the potential participant downloads the client part of the program code onto his personal computer and runs it. The client application accesses the server over the Internet, receives a computational task, data for processing, performs calculations and sends their results back. In this case, calculations are carried out in the background and with minimal priority, so that the operation of such an application does not affect the user’s main work.
This work is devoted to the development of an algorithm that allows performing biological calculations on the personal computers of scientific volunteers. An algorithm for sequential search for an expanding sequence is proposed and implemented in the form of program code, and the computational efficiency is shown.