{'fraction_non_alphanumeric': 0.011001100110011002, 'fraction_numerical': 0.0, 'mean_word_length': 5.594202898550725, '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}}
Genetic approach to biosequence alignment (GABA)

Alignment of biological sequences is one of the most important and challenging tasks in computational biology and bioinformatics and is inherently complex. The algorithmic solutions are characterized by huge computational and memory requirements. We present an approach to biosequences alignment, that uses a genetic algorithm to search the solution space. By converting a given biomolecular sequence into an optimal or near optimal search problem in the solution space, the genetic algorithm efficiently and robustly finds the solution for the multiple sequence alignment. Our approach is different from previous similar approaches in the sense that it allows pairwise alignment in each generation and does not utilize dynamic programming at any stage. This paper presents our approach and demonstrates its performances with experiments on real DNA datasets.