138 search results - page 1 / 28 » Approximation Algorithms for Bounded Degree Phylogenetic Roo... |
ALGORITHMICA
2008
13 years 5 months ago
2008
WG
2004
Springer
13 years 10 months ago
2004
Springer
The Phylogenetic kth Root Problem (PRk) is the problem of finding a (phylogenetic) tree T from a given graph G = (V, E) such that (1) T has no degree-2 internal nodes, (2) the ex...
ISAAC
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...
TCS
2010
12 years 11 months ago
2010
Abstract. A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white ve...
IPL
2002
13 years 4 months ago
2002
We consider two aesthetic criteria for the visualization of rooted trees: inclusion and tip-over. Finding the minimum area layout according to either of these two standards is an ...