4 search results - page 1 / 1 » Maximum agreement and compatible supertrees |
103
click to vote
CORR
2008
Springer
15 years 9 days 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 ...
75
Voted
JDA
2007
15 years 3 days ago
2007
CPM
2007
Springer
15 years 6 months ago
2007
Springer
90
Voted
LATIN
2004
Springer
15 years 5 months ago
2004
Springer