{'fraction_non_alphanumeric': 0.01647058823529412, 'fraction_numerical': 0.0, 'mean_word_length': 5.173913043478261, '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}}
Some Properties of Robinson Graphs

Robinson graphs are con guration graphs over sets of phylogenetic trees. Their neighbor relation is given by all possible crossovers along inner edges of these trees. We show that Robinson graphs generate coherent algebras the cell partition of which equals the automorphism partition. Each cell consists of all phylogenetic trees having isomorphic inner trees (induced by the non-leaves).