Recent Results on Three Problems in Comparative Structural RNAomics

Shay Zakov, Nimrod Milo, Tamar Pinhas, Sivan Yogev, Erez Katzenelson, Eitan Bachmat, Yefim Dinitz, Dekel Tsur and Michal Ziv-Ukelson
Reference. Shay Zakov, Nimrod Milo, Tamar Pinhas, Sivan Yogev, Erez Katzenelson, Eitan Bachmat, Yefim Dinitz, Dekel Tsur and Michal Ziv-Ukelson. 2014. Recent Results on Three Problems in Comparative Structural RNAomics. Proceedings of 1st workshop on Computational Methods for Structural RNAs (CMSR'14). isbn:978-2-9550187-0-5. pp. 57-58. doi:10.15455/CMSR.2014.0005
Abstract. 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/.
Presented at CMSR'14 (Strasbourg, France) on September 7th 2014 at 11:30 by Michal Ziv-Ukelson.

License information

Creative Commons LicenseThe proceedings of CMSR'14 are distributed under the terms of a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License. Ownership of the copyright for the articles is retained by their authors. They allow anyone to download, reuse, reprint, distribute, and/or copy articles for any non-commercial purposes, provided that the original authors and source are appropriately cited.