431 search results - page 49 / 87 » Drawing Phylogenetic Trees |
SIAMCOMP
2000
14 years 11 months ago
2000
The bipartite crossing number problem is studied, and a connection between this problem and the linear arrangement problem is established. It is shown that when the arboricity is ...
126
click to vote
CCECE
2006
IEEE
15 years 5 months ago
2006
IEEE
In this paper, we introduce new algorithms for selecting taxon samples from large evolutionary trees, maintaining uniformity and randomness, under certain new constraints on the t...
100
click to vote
CORR
2008
Springer
14 years 12 months ago
2008
Springer
Consider a set of labels L and a set of trees T = {T (1) , T (2) , . . . , T (k) } where each tree T (i) is distinctly leaf-labeled by some subset of L. One fundamental problem is ...
DAGSTUHL
2008
15 years 1 months ago
2008
Allowing templates with infinite domains greatly expands the range of problems that can be formulated as a non-uniform constraint satisfaction problem. It turns out that many CSPs ...
SIGGRAPH
2000
ACM
15 years 4 months ago
2000
ACM
We present a method for automatically rendering pen-and-ink illustrations of trees. A given 3-d tree model is illustrated by the tree and a visual representation of the foliage us...