{'fraction_non_alphanumeric': 0.015070921985815602, 'fraction_numerical': 0.0, 'mean_word_length': 5.169398907103825, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A New Parallel Asynchronous Cellular Genetic Algorithm for de Novo Genomic Sequencing

This work proposes a new parallel asynchronous cellular genetic algorithm model for multi-core processors. The algorithm has been used for solving the DNA fragment assembly problem with the aim of finding highly accurate solutions in short computation times. This NP-Complete problem lies in reconstructing a DNA chain from multiple fragments that have previously been sequenced in a laboratory. The considered problem is a critical step in any genomic project, since the resulting chains are the basis for the entire work. Therefore, the quality of these chains is a major aspect for the correct development of the project. The proposed algorithm is able to find highly accurate results much faster than the other algorithms in the literature. Additionally, since it is parallel, it could be scalable to much larger problem instances, for which the methods typically used usually encounter difficulties. Finally, several new local search methods have been designed, and their influence on the performance of the algorithm has been analyzed.