CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Paremeterized enumeration, transversals, and imperfect phylogeny reconstruction

Peter Damaschke (Institutionen för datavetenskap, Algoritmer ; Institutionen för datavetenskap, Bioinformatik)
1st International Workshop on Parameterized and Exact Computation IWPEC'2004, Lecture Notes in Computer Science Vol. 3162 (2004), p. 1-12.
[Konferensbidrag, refereegranskat]

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.

Denna post skapades 2006-09-25. Senast ändrad 2015-02-11.
CPL Pubid: 1604


Institutioner (Chalmers)

Institutionen för datavetenskap, Algoritmer (2002-2004)
Institutionen för datavetenskap, Bioinformatik (2002-2004)


Information Technology

Chalmers infrastruktur