{'fraction_non_alphanumeric': 0.03530751708428246, 'fraction_numerical': 0.018223234624145785, 'mean_word_length': 4.782894736842105, '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 Exact Algorithm for the Zero Exemplar Breakpoint Distance Problem

The exemplar breakpoint distance problem is one of the most important problems in genome comparison and has been extensively studied in the literature. The exemplar breakpoint distance problem cannot be approximated within any factor even if each gene family occurs at most twice in a genome. This is due to the fact that its decision version, the zero exemplar breakpoint distance problem where each gene family occurs at most twice in a genome (ZEBD(2, 2) for short) is NP-hard. Thus, the basic version ZEBD(2, 2) has attracted the attention of many scientists. The best existing algorithm for ZEBD(2, 2) runs in O(n2n) time. In this paper, we propose a new algorithm for ZEBD(2, 2) with running time O(n21:86121n). We have implemented the algorithm in Java. The software package is available upon request.