The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
Thomas Erlebach, Alexander Hall, Michael Hoffmann ...
Due to the expensiveness of compiling and executing a large number of mutants, it is usually necessary to select a subset of mutants to substitute the whole set of generated mutan...
Lu Zhang, Shan-Shan Hou, Jun-Jue Hu, Tao Xie, Hong...
Despite the availability of a variety of program analysis tools, evaluation of these tools is difficult, as only few benchmark suites exist. Existing benchmark suites lack the uni...
Background: The identification of binding targets for proteins using ChIP-Seq has gained popularity as an alternative to ChIP-chip. Sequencing can, in principle, eliminate artifac...
Two dimensional point data can be considered one of the most basic, yet one of the most ubiquitous data types arising in a wide variety of applications. The basic scatter plot app...
Tatiana von Landesberger, Sebastian Bremm, Peyman ...