Research on Serial Algorithm for Comparing DNA Biostatistical Information Based on Shared Memory

We developed a method to divide the biological sequence to compare it with multiple segments. Each segment was assigned to a virtual ant. Then, the virtual ant searched for the best alignment location in the alignment space based on the rules of the ant colony algorithm. During the search process, virtual ants collaborated and communicated through pheromone deposition and volatilization mechanisms to search for the global optimal solution. Finally, the alignment results of all fragments were merged into the complete biological sequence alignment results. Experiment results showed that the parallel alignment method of biological sequences based on the ant colony algorithm significantly improved the alignment speed and accuracy, which is important foor the processing of large-scale biological data.