scientific article; zbMATH DE number 2086667

MaRDI QIDQ4737204zbMATH OpenFDO

Authors Guojun Li, Zimao Li, Bin Ma, Lusheng Wang, Xiaotie Deng

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2380/23800740.htm

zbMATH Keywords

computational biology

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Approximation algorithms (68W25) Protein sequences, DNA sequences (92D20)

Recommendations

• Genetic Design of Drugs Without Side-Effects
• scientific article; zbMATH DE number 1615273
• Parameterized intractability of distinguishing substring selection
• Fundamentals of Computation Theory
• scientific article; zbMATH DE number 1305456

Cited in

(11)

• Generalized substring selectivity estimation
• Distinguishing string selection problems.
• Heuristic approaches to the distinguishing substring selection problem
• RNA multiple structural alignment with longest common subsequences
• Parameterized intractability of distinguishing substring selection
• Hardness results for the center and median string problems under the weighted and unweighted edit distances
• scientific article; zbMATH DE number 1305456 (Why is no real title available?)
• Genetic Design of Drugs Without Side-Effects
• Separating sets of strings by finding matching patterns is almost always hard
• Slightly superexponential parameterized problems
• Strong computational lower bounds via parameterized complexity

This page was built for publication:

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