Mikko Koivisto

Set Partitioning via Inclusion-Exclusion

Given a set

Fourier meets möbius: fast subset convolution

N

An MDL method for finding haplotype blocks and for estimating the strength of haplotype block boundaries.

with

An O*(2^n ) Algorithm for Graph Coloring and Other Partitioning Problems via Inclusion--Exclusion

n

The Travelling Salesman Problem in Bounded Degree Graphs

elements and a family

Computing the Tutte Polynomial in Vertex-Exponential Time

\mathcal{F}

Counting paths and packings in halves

of subsets, we show how to partition

Mixture Model Clustering of Phenotype Features Reveals Evidence for Association of DTNBP1 to a Specific Subtype of Schizophrenia

N

The traveling salesman problem in bounded degree graphs

into

A hidden markov technique for haplotype reconstruction

k