16430 search results - page 88 / 3286 » On Computable Tree Functions |
122
click to vote
SIAMCOMP
2000
15 years 3 months ago
2000
This paper studies various algorithmic issues in reconstructing a species tree from gene trees under the duplication and the mutation cost model. This is a fundamental problem in c...
102
click to vote
RECOMB
1998
Springer
15 years 7 months ago
1998
Springer
This paper studies various properties of the least common ancestors mapping, the duplication and mutation costs, and the complexity of nding a species tree from gene trees.
140
click to vote
LICS
2007
IEEE
15 years 9 months ago
2007
IEEE
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
101
click to vote
WG
2004
Springer
15 years 8 months ago
2004
Springer
In this paper we study collective additive tree spanners for families of graphs that either contain or are contained in AT-free graphs. We say that a graph G = (V, E) admits a sys...
146
Voted
JMLR
2010
15 years 1 months ago
2010
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...