Orphan diseases are ones that affect very few people. For that reason, there may be no drugs specifically aimed at them, so one tries cocktails of drugs designed for other related diseases. One difficulty with cocktails is that drugs can interact badly. On the other hand, if drugs do not interact badly there is no reason not to try them together in the hopes of gaining a synergistic effect.
Mathematically, the drugs are nodes and harmful interactions are edges between drugs. Given such an undirected graph, the goal to find all maximal cocktails, which correspond to maximum independent sets.
No entries found
Log in to Read the Full Article
Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.
Please select one of the options below for access to premium content and features.
Create a Web Account
If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.
Join the ACM
Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.
Subscribe to Communications of the ACM Magazine
Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.
Purchase the Article
Non-members can purchase this article or a copy of the magazine in which it appears.