A Greedy Approximation Algorithm for Constructing Shortest Common Superstrings.

Jorma Tarhio Esko Ukkonen

Published in: Theor. Comput. Sci. (1988)

Keyphrases

greedy approximation algorithm
greedy algorithm
np hard
shortest path
lower bound
optimal solution
shortest common supersequence
multiscale
reinforcement learning
random walk