Sciweavers

137 search results - page 1 / 28
» Generalized Binary Tanglegrams: Algorithms and Applications
Sort
View
BICOB
2009
Springer
13 years 11 months ago
Generalized Binary Tanglegrams: Algorithms and Applications
Several applications require the joint display of two phylogenetic trees whose leaves are matched by inter-tree edges. This issue arises, for example, when comparing gene trees and...
Mukul S. Bansal, Wen-Chieh Chang 0002, Oliver Eule...
ALENEX
2009
106views Algorithms» more  ALENEX 2009»
13 years 5 months ago
Drawing Binary Tanglegrams: An Experimental Evaluation
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
Martin Nöllenburg, Markus Völker, Alexan...
WEA
2010
Springer
330views Algorithms» more  WEA 2010»
13 years 11 months ago
Exact Bipartite Crossing Minimization under Tree Constraints
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
Frank Baumann, Christoph Buchheim, Frauke Liers
ALGORITHMICA
2011
12 years 11 months ago
An Approximation Algorithm for Binary Searching in Trees
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
Eduardo Sany Laber, Marco Molinaro
ACMSE
2006
ACM
13 years 10 months ago
Framework design using function generalization: a binary tree traversal case study
A software framework is a technology that enables software reuse, potentially yielding rich dividends but requiring significant longterm investment. However, a framework is not a ...
H. Conrad Cunningham, Yi Liu, Pallavi Tadepalli