A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs
From MaRDI portal
Publication:845829
DOI10.1016/J.IPL.2006.05.008zbMATH Open1185.68280OpenAlexW2089582973MaRDI QIDQ845829FDOQ845829
Authors: Peter Damaschke 
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2006.05.008
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
- Publication:2723948
- Parameterized complexity of the arc-preserving subsequence problem
- Computing the similarity of two sequences with nested arc annotations
Cites Work
Cited In (7)
- What Makes the Arc-Preserving Subsequence Problem Hard?
- Computational Science – ICCS 2005
- Parameterized complexity of the arc-preserving subsequence problem
- The longest common subsequence problem for sequences with nested arc annotations.
- Fast arc-annotated subsequence matching in linear space
- Title not available (Why is that?)
- Fast arc-annotated subsequence matching in linear space
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)
