The longest common subsequence problem for arc-annotated sequences

MaRDI QIDQ2908085zbMATH OpenFDO

Authors Vladimir Popov

Publication date 4 September 2012

Published in International Mathematical Forum (Search for Journal in Brave)

Full work available at URL http://www.m-hikari.com/imf-2011/41-44-2011/index.html

zbMATH Keywords

longest common subsequenceMAX SNP-hardsequence annotation

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(5)

• scientific article; zbMATH DE number 1615278 (Why is no real title available?)
• A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs
• The longest common subsequence problem for arc-annotated sequences
• Arc-preserving subsequences of arc-annotated sequences
• The longest common subsequence problem for sequences with nested arc annotations.

This page was built for publication: The longest common subsequence problem for arc-annotated sequences

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