{'fraction_non_alphanumeric': 0.015488867376573089, 'fraction_numerical': 0.0, 'mean_word_length': 5.382716049382716, '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}}
An efficient solution for aligning huge DNA sequences

Recently, many parallel solutions were proposed in order to accelerate the exact methods for optimal alignment of DNA sequences. However, most of these solutions calculate only the alignment similarity score without finding the actual alignment. This paper presents an efficient solution to find the optimal alignment of the huge DNA sequences. This solution releases the condition of the sequence size to be in megabyte-scale instead of few kilobytes. The fundamental innovation in this work is developing an efficient, linear space complexity, parallel solution to achieve the optimum alignment with relatively good performance. The shared memory parallel architecture is the focus of this work therefore; we have considered off-the-shelf systems like multi-core CPUs as well as advanced shared memory platforms. Experimental results show that the proposed solution achieved high records compared to other solutions that targeted the same goal with less hardware requirements.