Arc-preserving subsequences of arc-annotated sequences

MaRDI QIDQ3104398zbMATH OpenFDO

Authors Vladimir Popov

Publication date 19 December 2011

zbMATH Keywords

longest common subsequenceNP-completesequence annotation

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithms on strings (68W32)

Recommendations

• The longest common subsequence problem for arc-annotated sequences
• scientific article; zbMATH DE number 1754611
• The longest common subsequence problem for sequences with nested arc annotations.
• scientific article; zbMATH DE number 1615278
• The longest common subsequence problem for arc-annotated sequences

Cited in

(9)

• Computing the similarity of two sequences with nested arc annotations
• The longest common subsequence problem for arc-annotated sequences
• scientific article; zbMATH DE number 2185647 (Why is no real title available?)
• Parameterized complexity of the arc-preserving subsequence problem
• scientific article; zbMATH DE number 1754611 (Why is no real title available?)
• What Makes the Arc-Preserving Subsequence Problem Hard?
• Computational Science – ICCS 2005
• A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs
• The longest common subsequence problem for arc-annotated sequences

This page was built for publication: Arc-preserving subsequences of arc-annotated sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3104398)