Greedy algorithms for the shortest common superstring that are asymptotically optimal
A Frieze, W Szpankowski - Algorithmica, 1998 - Springer
There has recently been a resurgence of interest in the shortest common superstring
problem due to its important applications in molecular biology (eg, recombination of DNA)
and data compression. The problem is NP-hard, but it has been known for some time that
greedy algorithms work well for this problem. More precisely, it was proved in a recent
sequence of papers that in the worst case a greedy algorithm produces a superstring that is
at most β times (2≤ β≤ 4) worse than optimal. We analyze the problem in a probabilistic …
problem due to its important applications in molecular biology (eg, recombination of DNA)
and data compression. The problem is NP-hard, but it has been known for some time that
greedy algorithms work well for this problem. More precisely, it was proved in a recent
sequence of papers that in the worst case a greedy algorithm produces a superstring that is
at most β times (2≤ β≤ 4) worse than optimal. We analyze the problem in a probabilistic …
Greedy algorithms for the shortest common superstring that are asymtotically optimal
A Frieze, W Szpankowski - European Symposium on Algorithms, 1996 - Springer
There has recently been a resurgence of interest in the shortest common superstring
problem due to its important applications in molecular biology (eg, recombination of DNA)
and data compression. The problem is NP-hard, but it has been known for some time that
greedy algorithms work well for this problem. More precisely, it was proved in a recent
sequence of papers that in the worst case a greedy algorithm produces a superstring that is
at most β times (2≤ β≤ 4) worse than optimal. We analyze the problem in a probabilistic …
problem due to its important applications in molecular biology (eg, recombination of DNA)
and data compression. The problem is NP-hard, but it has been known for some time that
greedy algorithms work well for this problem. More precisely, it was proved in a recent
sequence of papers that in the worst case a greedy algorithm produces a superstring that is
at most β times (2≤ β≤ 4) worse than optimal. We analyze the problem in a probabilistic …