65 citations · 156 across the 12 of their papers we have counts for
14 papers
Coloring for dispersion: A polynomial-time algorithm for cardinality-constrained 2-anticlustering
Nguyen Khoa Tran, Lin Mu, Martin Papenberg +1
The -Maximum Dispersion Problem with Cardinality Constraints (-MDCC) asks for a partition of a given item set with pairwise dissimilarities into cardinality-constrained g…
Solving the Maximum-Weight Connected Subgraph Problem to Optimality
Mohammed El-Kebir, Gunnar W. Klau
Given an undirected node-weighted graph, the Maximum-Weight Connected Subgraph problem (MWCS) is to identify a subset of nodes of maximalsum of weights that induce a connected subg…
eXamine: Exploring annotated modules in networks
Kasper Dinkla, Mohammed El-Kebir, Cristina-Iulia Bucur +4
Background: Biological networks have a growing importance for the interpretation of high-throughput omics data. Integrative network analysis makes use of statistical and combinator…
eXamine: a Cytoscape app for exploring annotated modules in networks
Kasper Dinkla, Mohammed El-Kebir, Cristina-Iulia Bucur +4
Background. Biological networks have growing importance for the interpretation of high-throughput "omics" data. Statistical and combinatorial methods allow to obtain mechanistic in…
Next Generation Cluster Editing
Thomas Bellitto, Tobias Marschall, Alexander Schönhuth +1
This work aims at improving the quality of structural variant prediction from the mapped reads of a sequenced genome. We suggest a new model based on cluster editing in weighted gr…
A Realistic Model under which the Genetic Code is Optimal
Harry Buhrman, Peter T. S. van der Gulik, Gunnar W. Klau +3
The genetic code has a high level of error robustness. Using values of hydrophobicity scales as a proxy for amino acid character, and the Mean Square measure as a function quantify…