Sciweavers

JCT
2006
77views more  JCT 2006»
13 years 4 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
JAIR
2008
94views more  JAIR 2008»
13 years 4 months ago
The Ultrametric Constraint and its Application to Phylogenetics
A phylogenetic tree shows the evolutionary relationships among species. Internal nodes of the tree represent speciation events and leaf nodes correspond to species. A goal of phyl...
Neil C. A. Moore, Patrick Prosser
IWOCA
2009
Springer
137views Algorithms» more  IWOCA 2009»
13 years 11 months ago
Embedded Trees and the Support of the ISE
Embedded trees are labelled rooted trees, where the root has zero label and where the labels of adjacent vertices differ (at most) by
Michael Drmota