Home → Magazine Archive → July 2018 (Vol. 61, No. 7) → String Wars → Abstract
By Dennis Shasha
Communications of the ACM,
Vol. 61 No. 7, Page 104
10.1145/3219818
![[article image]](https://cacm.acm.org/system/assets/0003/1657/062018_Getty_String-Wars2.large.jpg?1529516811&1529516810 "String Wars, illustration")
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
Create a Web Account
If you are an ACM member, Communications subscriber, Digital Library subscriber, or use your institution's subscription, please set up a web account to access premium content and site features. If you are a SIG member or member of the general public, you may set up a web account to comment on free articles and sign up for email alerts.