English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper we consider the problem of computing an mRNA sequence ofmaximal similarity for a given mRNA of secondary structure constraints,introduced by Backofen et al. in [BNS02] denoted as the MRSO problem. Theproblem is known to be NP-complete for planar associated implied structuregraphs of vertex degree at most 3. In [BFHV05] a first polynomial dynamicprogramming algorithms for MRSO on implied structure graphs with maximum vertexdegree 3 of bounded cut-width is shown. We give a simple but more generalpolynomial dynamic programming solution for the MRSO problem for associatedimplied structure graphs of bounded clique-width. Our result implies that MRSOis polynomial for graphs of bounded tree-width, co-graphs, $P_4$-sparse graphs,and distance hereditary graphs. Further we conclude that the problem ofcomparing two solutions for MRSO is hard for the class of problems which can besolved in polynomial time with a number of parallel queries to an oracle in NP.

Polynomial algorithms for protein similarity search for restricted mRNA structures