A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs
type: Item
instance of: scholarly article
title: A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs
zbMATH Open document ID: 1185.68280
author: Peter Damaschke
published in: Information Processing Letters
publication date: 2010-01-29T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 5664693
zbMATH Keywords: RNA structure
zbMATH Keywords: pattern matching
zbMATH Keywords: dynamic programming
zbMATH Keywords: design of algorithms
MaRDI profile type: Publication
full work available at URL: j.ipl.2006.05.008
OpenAlex ID: W2089582973
cites work: Computing the similarity of two sequences with nested arc annotations
cites work: Computational Science – ICCS 2005
cites work: Q4415254
cites work: Q2723948
cites work: The longest common subsequence problem for sequences with nested arc annotations.
cites work: Computing similarity between RNA structures
DOI: 10.1016/J.IPL.2006.05.008
Recommended article: Q3104398
Recommended article: Q4535038
Recommended article: The longest common subsequence problem for sequences with nested arc annotations.
Recommended article: Q4737693
Recommended article: The longest common subsequence problem for arc-annotated sequences
Recommended article: Q2723948
Recommended article: Parameterized Complexity of the Arc-Preserving Subsequence Problem
Recommended article: Computing the similarity of two sequences with nested arc annotations
description: scientific article; zbMATH DE number 5664693