<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06065612</id>
  <dt>a</dt>
  <an>06065612</an>
  <augroup>
    <au>Amit, Mika</au>
    <au>Backofen, Rolf</au>
    <au>Heyne, Steffen</au>
    <au>Landau, Gad M.</au>
    <au>M\"ohl, Mathias</au>
    <au>Schmiedl, Christina</au>
    <au>Will, Sebastian</au>
  </augroup>
  <ti>Local exact pattern matching for non-fixed RNA structures.</ti>
  <so>K\"arkk\"ainen, Juha (ed.) et al., Combinatorial pattern matching. 23rd annual symposium, CPM 2012, Helsinki, Finland, July 3--5, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31264-9/pbk). Lecture Notes in Computer Science 7354, 306-320 (2012).</so>
  <py>2012</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/978-3-642-31265-6_25</li>
  </ligroup>
  <abgroup>
    <ab>Summary: Detecting local common sequence-structure regions of RNAs is a biologically meaningful problem. By detecting such regions, biologists are able to identify functional similarity between the inspected molecules. We developed dynamic programming algorithms for finding common structure-sequence patterns between two RNAs. The RNAs are given by their sequence and a set of potential base pairs with associated probabilities. In contrast to prior work which matches fixed structures, we support the arc breaking edit operation; this allows to match only a subset of the given base pairs. We present an $O(n ^{3})$ algorithm for local exact pattern matching between two nested RNAs, and an $O(n ^{3} \log n)$ algorithm for one nested RNA and one bounded-unlimited RNA.</ab>
    <rv></rv>
  </abgroup>
</item>