A Satisfiability-based Approach for Generalized Tanglegrams on Level Graphs

Wotzlaw, Andreas and Speckenmeyer, Ewald and Porschen, Stefan (2012) A Satisfiability-based Approach for Generalized Tanglegrams on Level Graphs. , Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH. (Unpublished)

Abstract

A tanglegram is a pair of (not necessarily binary) trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in computational biology to compare evolutionary histories of species. In this work we present a formulation of two related combinatorial embedding problems concerning tanglegrams in terms of CNF-formulas. The first problem is known as the planar embedding and the second as the crossing minimization problem. We show that our satisfiability-based encoding of these problems can handle a much more general case with more than two, not necessarily binary or complete, trees defined on arbitrary sets of leaves and allowed to vary their layouts. Furthermore, we present an experimental comparison of our technique and several known heuristics for solving generalized binary tanglegrams, showing its competitive performance and efficiency and thus proving its practical usability.


Actions:
Download: [img] PDF (Dagstuhl Seminar ”SAT Interactions”) - Presentation
Download (287kB) | Preview
Editorial actions: View Item View Item (Login required)
Deposit Information:
ZAIK Number: UNSPECIFIED
Depositing User: Andreas Wotzlaw
Date Deposited: 17 Jan 2013 13:09
Last Modified: 17 Jan 2013 13:09
URI: http://e-archive.informatik.uni-koeln.de/id/eprint/693