{'fraction_non_alphanumeric': 0.011956521739130435, 'fraction_numerical': 0.004347826086956522, 'mean_word_length': 4.941935483870968, '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}}
New scalable measure for comparing phylogenetic trees

The problem of comparing phylogenetic trees is based on finding a distance between different models of evolution. This problem is important because of existing various methods for reconstructing phylogenies, which applied to the same data set result in different trees. In the paper we construct a measure in a polynomial time using new structures called i-clusters. We analyze properties of i-clusters and prove that the measure is a metric in some space of rooted phylogenetic trees. The constructed measure is parametrized and the scalability parameter may be defined by user according to the real data size and complexity. The presented measure is the extension of widely applied error metric, defined by Robinson and Foulds in 1981. The generalization enables us to ommit small mistakes on low level and not to loose similarity of compared trees on high level.