Abstract
A tanglegram is a pair of 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 paper we present a formulation of two related combinatorial embedding problems concerning tanglegrams in terms of CNF-formulas. The first problem is known as planar embedding and the second as crossing minimization problem. We show that our satisfiability formulation 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. © 2011 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Speckenmeyer, E., Wotzlaw, A., & Porschen, S. (2011). A satisfiability-based approach for embedding generalized tanglegrams on level graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6695 LNCS, pp. 134–144). https://doi.org/10.1007/978-3-642-21581-0_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
