Universität zu Köln

Wotzlaw, Andreas, Speckenmeyer, Ewald and Porschen, Stefan (2012). Generalized k-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation. Discrete Applied Mathematics, 160 (16-17). pp. 2349-2363. Elsevier.

Preview

PDF zaik2011-631.pdf - Submitted Version Download (438kB) | Preview

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-base 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.

Item Type:	Journal Article
Creators:	Creators Email ORCID ORCID Put Code Wotzlaw, Andreas UNSPECIFIED UNSPECIFIED UNSPECIFIED Speckenmeyer, Ewald UNSPECIFIED UNSPECIFIED UNSPECIFIED Porschen, Stefan UNSPECIFIED UNSPECIFIED UNSPECIFIED
URN:	urn:nbn:de:hbz:38-550194
Journal or Publication Title:	Discrete Applied Mathematics
Volume:	160
Number:	16-17
Page Range:	pp. 2349-2363
Date:	2012
Publisher:	Elsevier
Language:	English
Faculty:	Faculty of Mathematics and Natural Sciences
Divisions:	Faculty of Mathematics and Natural Sciences > Department of Mathematics and Computer Science > Institute of Computer Science
Subjects:	Data processing Computer science
Refereed:	No
URI:	http://kups.ub.uni-koeln.de/id/eprint/55019