4 citations · 8 across the 5 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
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…