Two approaches to the common superstring problem

MaRDI QIDQ3070876zbMATH OpenFDO

Authors Marta Kasprzak

Publication date 28 January 2011

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 1263192
• Approximation algorithms for the shortest common superstring problem
• Linear approximation of shortest superstrings
• A linear-time algorithm for finding approximate shortest common superstrings
• Publication:4725747

Cited in

(2)

• A tissue \(P\) system and a DNA microfluidic device for solving the shortest common superstring problem
• Superstring graph: a new approach for genome assembly

This page was built for publication: Two approaches to the common superstring problem

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