scientific article; zbMATH DE number 1420898

MaRDI QIDQ4944967zbMATH OpenFDO

Authors Sascha Ott

Publication date 17 October 2000

zbMATH Keywords

shortest common superstring problem

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Approximating Shortest Superstrings
• Approximation algorithms for the shortest common superstring problem
• scientific article; zbMATH DE number 827942
• Improved length bounds for the shortest superstring problem

Cited in

(9)

• A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem
• Superstring graph: a new approach for genome assembly
• On the shortest common superstring of NGS reads
• Restricted common superstring and restricted common supersequence
• A probabilistic PTAS for shortest common superstring
• Approximating shortest superstring problem using de Bruijn graphs
• \boldmath A 2\frac12-Approximation Algorithm for Shortest Superstring
• Restricted and swap common superstring: a multivariate algorithmic perspective
• Mathematical Foundations of Computer Science 2005

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 Q4944967)