Greedy algorithms for the shortest common superstring that are asymptotically optimal

DOI10.1007/PL00009207zbMATH Open0896.68067WikidataQ57401553 ScholiaQ57401553MaRDI QIDQ1386458FDOQ1386458

Authors: Alan Frieze, Wojciech Szpankowski 

Publication date: 24 May 1998

Published in: Algorithmica (Search for Journal in Brave)

Recommendations

• Greedy algorithms for the shortest common superstring that are asymtotically optimal
• Linear approximation of shortest superstrings
• Why Greed Works for Shortest Common Superstring Problem
• Why greed works for shortest common superstring problem

zbMATH Keywords

shortest common superstring

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cited In (13)

• A probabilistic PTAS for shortest common superstring
• Viral Genome Compression
• Why Greed Works for Shortest Common Superstring Problem
• Why greed works for shortest common superstring problem
• Algorithms for Three Versions of the Shortest Common Superstring Problem
• Greedy algorithms for the shortest common superstring that are asymtotically optimal
• A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem
• Greedy Conjecture for Strings of Length 4
• On the greedy algorithm for the shortest common superstring problem with reversals
• Approximation algorithms for the shortest common superstring problem
• A Probabilistic PTAS for Shortest Common Superstring
• All instantiations of the greedy algorithm for the shortest common superstring problem are equivalent
• Title not available (Why is that?)

This page was built for publication: Greedy algorithms for the shortest common superstring that are asymptotically optimal

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