A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs
From MaRDI portal
Publication:845829
Recommendations
- Arc-preserving subsequences of 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 2087047
- The longest common subsequence problem for arc-annotated sequences
- The longest common subsequence problem for arc-annotated sequences
- scientific article; zbMATH DE number 1615278
- Parameterized complexity of the arc-preserving subsequence problem
- Computing the similarity of two sequences with nested arc annotations
Cites work
- scientific article; zbMATH DE number 1615278 (Why is no real title available?)
- scientific article; zbMATH DE number 1954383 (Why is no real title available?)
- Computational Science – ICCS 2005
- Computing similarity between RNA structures
- Computing the similarity of two sequences with nested arc annotations
- The longest common subsequence problem for sequences with nested arc annotations.
Cited in
(7)- Computational Science – ICCS 2005
- Fast arc-annotated subsequence matching in linear space
- Fast arc-annotated subsequence matching in linear space
- scientific article; zbMATH DE number 1954383 (Why is no real title available?)
- Parameterized complexity of the arc-preserving subsequence problem
- The longest common subsequence problem for sequences with nested arc annotations.
- What Makes the Arc-Preserving Subsequence Problem Hard?
This page was built for publication: A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845829)