Algorithmic Aspects of a General Modular Decomposition Theory

A new general decomposition theory inspired from modular graph decomposition is presented. This helps unifying modular decomposition on different structures, including (but not restricted to) graphs. Moreover, even in the case of graphs, the terminology ``module'' not only captures the classical graph modules but also allows to handle 2-connected components, star-cutsets, and other vertex subsets. The main result is that most of the nice algorithmic tools developed for modular decomposition of graphs still apply efficiently on our generalisation of modules. Besides, when an essential axiom is satisfied, almost all the important properties can be retrieved. For this case, an algorithm given by Ehrenfeucht, Gabow, McConnell and Sullivan 1994 is generalised and yields a very efficient solution to the associated decomposition problem

Carbons Into Bytes: Patented Chemical Compound Protection in the Virtual World

“Virtual” molecular compounds, created in molecular modeling software, are increasingly useful in the process of rational drug design. When a physical compound is patented, however, virtual use of the compound allows researchers to circumvent the protection granted to the patentee. To acquire protection from unauthorized use of compounds in their virtual form, patentees must directly claim the virtual compound. But Supreme Court decisions such as Bilski v. Kappos and Mayo Collaborative Services v. Prometheus Laboratories, Inc. call into question whether virtual compound claims are patentable subject matter under § 101. Using the guidance offered by the Supreme Court and Federal Circuit, this Issue Brief argues that virtual compound claims are not abstract ideas and therefore, consistent with patent policy, qualify as patentable subject matter