A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs

DOI10.1016/J.IPL.2006.05.008zbMath1185.68280OpenAlexW2089582973MaRDI QIDQ845829

Peter Damaschke

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.05.008

zbMATH Keywords

dynamic programmingdesign of algorithmspattern matchingRNA structure

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Dynamic programming (90C39)

Related Items (2)

Fast arc-annotated subsequence matching in linear space ⋮ Parameterized Complexity of the Arc-Preserving Subsequence Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Computing similarity between RNA structures
• The longest common subsequence problem for sequences with nested arc annotations.
• Computing the similarity of two sequences with nested arc annotations
• Computational Science – ICCS 2005

This page was built for publication: A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs