scientific article; zbMATH DE number 2086667
From MaRDI portal
Publication:4737204
zbMath1057.68134MaRDI QIDQ4737204
Guo Jun Li, Bin Ma, Lusheng Wang, Zimao Li, Xiaotie Deng
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2380/23800740.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonnumerical algorithms (68W05) Protein sequences, DNA sequences (92D20) Approximation algorithms (68W25)
Related Items (5)
RNA multiple structural alignment with longest common subsequences ⋮ Strong computational lower bounds via parameterized complexity ⋮ Separating sets of strings by finding matching patterns is almost always hard ⋮ Slightly Superexponential Parameterized Problems ⋮ Hardness results for the center and median string problems under the weighted and unweighted edit distances
This page was built for publication:
