773 search results - page 53 / 155 » Suffix Trees on Words |
169
click to vote
ALGORITHMICA
2000
15 years 6 months ago
2000
We present an O(NV +V 3) time algorithm for enumerating all spanning trees of a directed graph. This improves the previous best known bound of O(NE + V + E) [1] when V 2 = o(N), wh...
155
click to vote
CPC
2002
15 years 6 months ago
2002
The Wiener index is analyzed for random recursive trees and random binary search trees in the uniform probabilistic models. We obtain the expectations, asymptotics for the varianc...
149
click to vote
JCT
2006
15 years 6 months ago
2006
Consider two locally finite rooted trees as equivalent if each of them is a topological minor of the other, with an embedding preserving the tree-order. Answering a question of va...
143
click to vote
SIAMCOMP
1998
15 years 5 months ago
1998
The inference of consensus from a set of evolutionary trees is a fundamental problem in a number of fields such as biology and historical linguistics, and many models for inferrin...
154
click to vote
FOGA
2007
15 years 7 months ago
2007
Barrier trees are a convenient way of representing the structure of complex combinatorial landscapes over graphs. Here we generalize the concept of barrier trees to landscapes de...