62 citations · 66 across the 2 of their papers we have counts for
3 papers
q-bio.GN2005★ 4 cited
On the Complexity of Several Haplotyping Problems
Rudi Cilibrasi, Leo van Iersel, Steven Kelk +1
In this paper we present a collection of results pertaining to haplotyping. The first set of results concerns the combinatorial problem of reconstructing haplotypes from incomplete…
cs.CC2005
Limits of Rush Hour Logic Complexity
John Tromp, Rudi Cilibrasi
Rush Hour Logic was introduced in [Flake&Baum99] as a model of computation inspired by the ``Rush Hour'' toy puzzle, in which cars can move horizontally or vertically within a park…
cs.CV2003★ 62 cited
Clustering by compression
Rudi Cilibrasi, Paul Vitanyi
We present a new method for clustering based on compression. The method doesn't use subject-specific features or background knowledge, and works as follows: First, we determine a u…