Paremeterized enumeration, transversals, and imperfect phylogeny reconstruction

Paper in proceeding, 2004

We study parameterized enumeration problems where we are interested in all solutions of limited size, rather than just some minimum solution. In particular, we study the computation of the transversal hypergraph restricted to hyperedges with at most k elements. Then we apply the results and techniques to almost-perfect phylogeny reconstruction in computational biology. We also derive certain concise descriptions of all vertex covers of size at most k in a graph, within less than the trivial time bound.