Solving the shortest common supersequence problem.

MaRDI QIDQ4789858zbMATH OpenFDO

Authors Gaia Nicosia, Gianpaolo Oriolo

Publication date 2001

zbMATH Keywords

shortest common supersequenceshortest path problem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An approximate \(A^{\ast}\) algorithm and its application to the SCS problem.
• scientific article; zbMATH DE number 827942
• scientific article; zbMATH DE number 4095235
• A beam search for the shortest common supersequence problem guided by an approximate expected length calculation
• On the approximation of shortest common supersequences and longest common subsequences

Cited in

(8)

• On the inadequacy of tournament algorithms for the N-SCS problem
• The shortest common nonsubsequence problem is NP-complete
• An approximate \(A^{\ast}\) algorithm and its application to the SCS problem.
• A beam search for the shortest common supersequence problem guided by an approximate expected length calculation
• scientific article; zbMATH DE number 4095235 (Why is no real title available?)
• The constrained shortest common supersequence problem
• On the approximation of shortest common supersequences and longest common subsequences
• Weighted shortest common supersequence

This page was built for publication: Solving the shortest common supersequence problem.

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