Home → Magazine Archive → July 2018 (Vol. 61, No. 7) → String Wars → Abstract

String Wars

By Dennis Shasha

Communications of the ACM, Vol. 61 No. 7, Page 104

[article image]

Suppose someone gives you two strings: X and Y. Your goal is to design a minimum-cost collection of smaller strings coll (X|Y) that match and cover every character of string X With order independence without matching any substring of string Y.

Let us first break down that last sentence:


No entries found