{'fraction_non_alphanumeric': 0.03907815631262525, 'fraction_numerical': 0.006012024048096192, 'mean_word_length': 5.204968944099379, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 1, '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}}
Recent Results on Three Problems in Comparative Structural RNAomics

We review our recent results on three problems in Comparative Structural RNAomics. Our contribution includes: (1) a new worst-case bound for Discrete RNA Folding, (2) Unordered Unrooted Comparisons of RNA Trees, and (3) an RNA Homology Search where the query is an RNA sequence and the output consists of Sequence-Structure homology hits allowing pseudoknots and alternative stems. 
A common denominator of these three works is that they demonstrate research problems tackled within current structural RNAomics, whose solution extends to more general classical problems in Computer Science, yielding respectively: (1) a new theoretical bound for Discrete Min-Plus Matrix Multiplication, (2) a new theoretical bound for All-Pairs Cavity Bipartite Matching, and (3) new admissible heuristics to speed up Max Weighted Clique. Source code and web-interface for the tools can be found in our website http://www.cs.bgu.ac.il/~negevcb/.