Greedy Shortest Common Superstring Approximation in Compact Space.

Jarno Alanko Tuukka Norri

Published in: SPIRE (2017)

Keyphrases

search algorithm
artificial intelligence
search space
greedy algorithm
approximation algorithms
space time
shortest common supersequence
genetic algorithm
website
lower bound
np hard
dynamic programming
low dimensional
error bounds
higher dimensional
space requirements