Parameterized Complexity of the Arc-Preserving Subsequence Problem

DOI10.1007/978-3-642-16926-7_23zbMath1309.68098OpenAlexW29789891MaRDI QIDQ3057629

Dániel Marx, Ildikó Schlotter

Publication date: 16 November 2010

Published in: Graph Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-16926-7_23

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Permutations, words, matrices (05A05)

Cites Work

• Unnamed Item
• A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs
• The longest common subsequence problem for arc-annotated sequences
• 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
• Parametrized complexity theory.
• Pattern matching for arc-annotated sequences
• Computational Science – ICCS 2005