activity
20112018
most citedIntractability of the Minimum-Flip Supertree problem and its variants

4 citations · 8 across the 5 of their papers we have counts for

collaborators

6 papers

cs.DS2018

Heuristic algorithms for the Maximum Colorful Subtree problem

Kai Dührkop, Marie Anne Lataretu, W. Timothy J. White +1

In metabolomics, small molecules are structurally elucidated using tandem mass spectrometry (MS/MS); this resulted in the computational Maximum Colorful Subtree problem, which is N…

q-bio.QM2015★ 1 cited

Fragmentation trees reloaded

Kai Dührkop, Sebastian Böcker

Metabolites, small molecules that are involved in cellular reactions, provide a direct functional signature of cellular state. Untargeted metabolomics experiments usually relies on…

cs.DS2013★ 3 cited

The generalized Robinson-Foulds metric

Sebastian Böcker, Stefan Canzar, Gunnar W. Klau

The Robinson-Foulds (RF) metric is arguably the most widely used measure of phylogenetic tree similarity, despite its well-known shortcomings: For example, moving a single taxon in…

q-bio.QM2013

Faster mass decomposition

Kai Dührkop, Marcus Ludwig, Marvin Meusel +1

Metabolomics complements investigation of the genome, transcriptome, and proteome of an organism. Today, the vast majority of metabolites remain unknown, in particular for non-mode…

cs.CC2011★ 4 cited

Intractability of the Minimum-Flip Supertree problem and its variants

Sebastian Böcker, Quang Bao Anh Bui, Francois Nicolas +1

Computing supertrees is a central problem in phylogenetics. The supertree method that is by far the most widely used today was introduced in 1992 and is called Matrix Representatio…

cs.CC2011

Various complexity results for computational mass spectrometry problems

Francois Nicolas, Sebastian Böcker

Define Minimum Soapy Union (MinSU) as the following optimization problem: given a -tuple of finite integer sets, find a -tuple of…