Two approaches to the common superstring problem

zbMATH Open1204.68281MaRDI QIDQ3070876FDOQ3070876

Authors: Marta Kasprzak 

Publication date: 28 January 2011

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Cited In (2)

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

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)