Sciweavers

656 search results - page 28 / 132
» Marrying Words and Trees
Sort
View
CPC
2002
80views more  CPC 2002»
14 years 11 months ago
The Wiener Index Of Random Trees
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...
Ralph Neininger
JCT
2006
77views more  JCT 2006»
14 years 11 months ago
There are uncountably many topological types of locally finite trees
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...
Lilian Matthiesen
SIAMCOMP
1998
111views more  SIAMCOMP 1998»
14 years 11 months ago
Computing the Local Consensus of Trees
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...
Sampath Kannan, Tandy Warnow
FOGA
2007
15 years 1 months ago
Saddles and Barrier in Landscapes of Generalized Search Operators
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...
Christoph Flamm, Ivo L. Hofacker, Bärbel M. R...
EOR
2006
110views more  EOR 2006»
14 years 11 months ago
Scatter search with path relinking for phylogenetic inference
We propose the use of scatter search with path relinking for the inference of phylogenetic trees. Solutions are here represented as trees whose leaves span the set of species unde...
Carlos Cotta