Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

FSTTCS
2005
Springer

favoriteEmaildiscussreport

115views Software Engineering» more FSTTCS 2005»

Comparing Trees Via Crossing Minimization

13 years 10 months ago

Comparing Trees Via Crossing Minimization

Download www.informatik.uni-trier.de

Abstract. Two trees with the same number of leaves have to be embedded in two layers in the plane such that the leaves are aligned in two adjacent layers. Additional matching edges between the leaves give a one-to-one correspondence between pairs of leaves of the diﬀerent trees. Do there exist two planar embeddings of the two trees that minimize the crossings of the matching edges ? This problem has important applications in the construction and evaluation of phylogenetic trees.

Henning Fernau, Michael Kaufmann, Mathias Poths

Real-time Traffic

Additional Matching Edges | FSTTCS 2005 | Matching Edges | Two Trees |

claim paper

Related Content

» Untangling Tanglegrams Comparing Trees by Their Drawings

» Markov Random Field Energy Minimization via Iterated Cross Entropy with Partition Strategy

» Generalized Binary Tanglegrams Algorithms and Applications

» Prolonging Network Lifetime via a Controlled Mobile Sink in Wireless Sensor Networks

» MIP models for connected facility location A theoretical and computational study

» Prebond testable lowpower clock tree design for 3D stacked ICs

» Fast replication in content distribution overlays

» Resource allocation strategies for constructive innetwork stream processing

» Optimizing the Reliable Distribution of Large Files within CDNs

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	FSTTCS
Authors	Henning Fernau, Michael Kaufmann, Mathias Poths

Comments (0)