The complexity of Shortest Common Supersequence for inputs with no identical consecutive letters.

Aurélie Lagoutte Sébastien Tavenas

Published in: CoRR (2013)

Keyphrases

shortest common supersequence
computational cost
computational complexity
worst case
lower complexity
knowledge base
multimedia
bayesian networks
information technology
multiresolution
hidden markov models
probabilistic model
upper bound