Abstract

We consider the complexity of the Shortest Common Supersequence (SCS) problem, i.e. the problem of finding for finite strings S 1, S 2,…, S u a shortest string S such that every S i can be obtained by deleting zero or more elements from S. The SCS problem is shown to be NP-complete for strings over an alphabet of size ⩾ 2.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call