scientific article; zbMATH DE number 1954383
From MaRDI portal
Publication:4415254
zbMath1027.68653MaRDI QIDQ4415254
Jens Gramm, Jiong Guo, Rolf Niedermeier
Publication date: 28 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2556/25560182.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorics on words (68R15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (9)
Computing the similarity of two sequences with nested arc annotations ⋮ A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs ⋮ Fast arc-annotated subsequence matching in linear space ⋮ Approximation of RNA multiple structural alignment ⋮ Approximating the 2-interval pattern problem ⋮ Extracting constrained 2-interval subsets in 2-interval sets ⋮ Fast detection of common sequence structure patterns in RNAs ⋮ Finding common structured patterns in linear graphs ⋮ A brief history of parameterized matching problems
This page was built for publication:
